An efficient distributed algorithm for constructing small dominating sets

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 33-42

  Jia, L ^a   Rajaraman, R ^a   Suel, T ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; PROBABILITY; THEOREM PROVING;

DISTRIBUTED ALGORITHMS; DOMINATING SET PROBLEM;

ALGORITHMS;

EID: 0034782303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. Complexity of network synchronization
2. Optimal distributed algorithms for minimum-weight spanning tree, counting, leader election and related problems
3. Network decomposition and locality in distributed computation
4. How to allocate network centers
5. Global optimization using local information with applications to flow control
6. Efficient NC algorithms for set cover with applications to learning and geometry
7. A derandomization using min-wise independent permutations
8. A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations
9. A greedy heuristic for the set-covering problem
10. Deterministic coin tossing with applications to optimal parallel list ranking
11. A threshold of ln n for approximiting set cover
12. Parallel symmetry-breaking in sparse graphs
13. A best possible heuristic for the k-center problem
14. Primal-dual approximation algorithms for metric facility location and k-median problems
15. An efficient distributed algorithm for constructing small dominating sets
16. Approximation algorithms for combinatorial problems
17. Reducibility among combinatorial problems
18. Fast distributed construction of k-dominating sets and applications
19. Virtual backbone generation and maintenance in ad hoc network mobility management
20. Locality in distributed graph algorithms
21. On the ratio of optimal integral and fractional covers
22. A parallel approximation algorithm for positive linear programming
23. The p-median problem and generalizations
24. Improved distributed algorithms for coloring and network decomposition problems
25. Distributed data structures: A complexity oriented view
26. Probabilistic construction of deterministic algorithms: Approximating packing integer programs
27. Primal-dual RNC approximation algorithms for set cover and covering integer programs