Constant-time distributed dominating set approximation

[1]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[2]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[3]  Lujun Jia,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002, Distributed Computing.

[4]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[5]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[6]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[7]  J. Y. Wu,et al.  On calculating connected dominating set for efficient routing in ad hoc wireless networks , 1999, DIALM '99.

[8]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[9]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[10]  U. Feige.  A threshold of ln n for approximating set cover , 1998, JACM.

[11]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[12]  Danny Raz,et al.  Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[13]  Petr Slavík,et al.  A tight analysis of the greedy algorithm for set cover , 1996, STOC '96.

[14]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[15]  Bonnie Berger,et al.  Efficient NC algorithms for set cover with applications to learning and geometry , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[17]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[18]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[21]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[22]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.