Constant-Time Distributed Dominating Set Approximation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 25-32

  Kuhn, Fabian ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad Hoc Networks; Approximation Algorithms; Distributed Algorithms; Dominating Sets; Linear Programming

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; HIERARCHICAL SYSTEMS; LINEAR PROGRAMMING; NETWORK PROTOCOLS; PROBABILITY; PROBLEM SOLVING; SET THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

AD-HOC NETWORKS; APPROXIMATION ALGORITHMS; DISTRIBUTED ALGORITHMS; DOMINATING SETS;

GRAPH THEORY;

EID: 1142281027     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872040     Document Type: Conference Paper

References (19)

1. K. Alzoubi, P.-J. Wan, and O. Frieder. Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks. In Proc. of the 3rd ACM Int. Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC), pages 157-164, EPFL Lausanne, Switzerland, 2002.
2. Y. Bartal, J. W. Byers, and D. Raz. Global Optimization Using Local Information with Applications to Flow Control. In Proc. of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS), pages 303-312, 1997.
3. B. Berger, J. Rompel, and P. Shor. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. Journal of Computer and System Sciences, 49:454-477, 1994.
4. V. Chvátal. Linear Programming. W. H. Freeman and Company, 1983.
5. D. Dubhashi, A. Mei, A. Panconesi, J. Radhakrishnan, and A. Srinivasan. Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 717-724, 2003.
6. U. Feige. A Threshold of In n for Approximating Set Cover. Journal of the ACM (JACM), 45(4):634-652, 1998.
7. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete Mobile Centers. In Proc. of the 17th annual symposium on Computational geometry (SCG), pages 188-196. ACM Press, 2001.
8. M. R. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
9. S. Guha and S. Khuller. Approximation Algorithms for Connected Dominating Sets. In Proc. of the 4th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 179-193, 1996.
10. L. Jia, R. Rajaraman, and R. Suel. An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 33-42, 2001.
11. D. S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences, 9:256-278, 1974.
12. R. M. Karp. Reducibility Among Combinatorial Problems. In Proc. of a Symposium on the Complexity of Computer Computations, pages 85-103, 1972.
13. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms, 28:40-66, 1998.
14. L. Lovasz. On the Ratio of Optimal Integral and Fractional Covers. Discrete Mathematics, 13:383-390, 1975.
15. M. Luby and N. Nisan. A Parallel Approximation Algorithm for Positive Linear Programming. In Proc. of the 25th ACM Symposium on Theory of Computing (STOC), pages 448-457, 1993.
16. S. Rajagopalan and V. Vazirani. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM Journal on Computing, 28:525-540, 1998.
17. R. Rajaraman. Topology Control and Routing in Ad hoc Networks: A Survey. SIGACT News, 33:60-73, June 2002.
18. P. Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover. In Proc. of the 28th ACM Symposium on Theory of Computing (STOC), pages 435-441, 1996.
19. J. Wu and H. Li. On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks. In Proc. of the 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), pages 7-14, 1999.