An efficient distributed algorithm for constructing small dominating sets

Distributed Computing

Volumn 15, Issue 4, 2002, Pages 193-205

  Jia, Lujun ^a   Rajaraman, Rajmohan ^a   Suel, Torsten ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Ad hoc network; Approximation algorithm; Distributed computing; Dominating set

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; SET THEORY;

DISTRIBUTED ALGORITHM; DISTRIBUTED NETWORK; POLYLOGARITHMIC TIME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036935239     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0078-0     Document Type: Article

References (28)

1. N. Alon, J. H. Spencer. The Probabilistic Method. New York, NY: Wiley 1991
2. B. Awerbuch. Complexity of network synchronization. Journal of the ACM 32:804-823, 1985
3. B. Awerbuch. Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 230-240, 1987
4. B. Awerbuch, A. V. Goldberg, M. Luby, S. A. Plotkin, Network decomposition and locality in distributed computation. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 364-369, 1989
5. J. Bar-Ilan, G. Kortsarz, D. Peleg. How to allocate network centers. Journal of Algorithms 15:385-415, 1993
6. Y. Bartal, J. Byers, D. Raz. Global optimization using local information with applications to flow control. In Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science, pp. 303-312, 1997
7. B. Berger, J. Rompel, P. Shor, Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci. 49:454-477, 1994
8. A. Broder, M. Charikar, M. Mitzenmacher. A derandomization using min-wise independent permutations. In M. Luby, J. Rolim, and M. Serna, editors, Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science, Vol. 1518, pp. 15-24. Berlin Heidelberg New York: Springer 1998
9. V. Chavátal. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4:233-235, 1979
10. R. Cole, U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Inform. Control 70:32-53, 1986
11. U. Feige. A threshold of ln n for approximating set cover. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 314-318, May 1996
12. M. R. Garey, D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman 1979.
13. A. V. Goldberg, S. A. Plotkin, G. E. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1:434-446, 1989
14. D. Hochbaum, D. Shmoys. A best possible heuristic for the k-center problem. Math. Oper. Res. 10:180-184, 1985.
15. K. Jain, V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 1-10, October 1999.
16. D. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9:256-278, 1974.
17. R. Karp. Reducibility among combinatorial problems. In: R. E. Miller, J. W. Thatcher (eds) Complexity of Computer Communications, pp. 85-103. New York: Plenum Press 1972
18. R. Karp. Probabilistic recurrence relations. Journal of the ACM 41:1136-1150, 1994
19. S. Kutten, D. Peleg. Fast distributed construction of k-dominating sets and applications. J. Algorithms 28:40-66, 1998
20. B. Liang, Z. Haas. Virtual backbone generation and maintenance in ad hoc network mobility management. In Proceedings of the 2000 IEEE INFOCOM, March 2000
21. N. Linial. Locality in distributed graph algorithms. SIAM J. Comput. 21:193-201, 1992
22. J. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics 13:383-390, 1975
23. M. Luby, N. Nisan. A parallel approximation algorithm for positive linear programming. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 448-457, May 1993
24. P. Mirchandani. The p-median problem and generalizations. In: P. Mirchandani, R. Francis (eds.) Discrete Location Theory, pp. 55-118. New York, NY: Wiley 1990
25. A. Panconesi, A. Srinivasan. The local nature of Δ-coloring and its algorithmic applications. Combinatorica 15:255-280, 1995
26. D. Peleg. Distributed data structures: A complexity oriented view. Proceedings of the 4th International Workshop on Distributed Algorithms, pp. 71-89, September 1990
27. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci. 37:130-143, 1998.
28. S. Rajagopalan, V. Vazirani. Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. Comput. 28:525-540, 1998