Distributed Computing

, Volume 17, Issue 4, pp 303–310 | Cite as

Constant-time distributed dominating set approximation

Abstract.

Finding a small dominating set is one of the most fundamental problems of classical graph theory. In this paper, we present a new fully distributed approximation algorithm based on LP relaxation techniques. For an arbitrary, possibly constant parameter k and maximum node degree \(\Delta\), our algorithm computes a dominating set of expected size \({\rm O}(k\Delta^{2/k}{\rm log}(\Delta)\vert DS_{\rm {OPT}}\vert)\) in \({\rm O}{(k^2)}\) rounds. Each node has to send \({\rm O}{(k^2\Delta)}\) messages of size \({\rm O}({\rm log}\Delta)\). This is the first algorithm which achieves a non-trivial approximation ratio in a constant number of rounds.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alzoubi K, Wan P-J, Frieder O: 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), EPFL Lausanne, Switzerland, 2002, pp 157-164Google Scholar
  2. 2.
    Bartal Y, Byers JW, Raz D: Global Optimization Using Local Information with Applications to Flow Control. In: Proc. of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS), 1997, pp 303-312Google Scholar
  3. 3.
    Berger B, Rompel J, Shor P: Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. J Comput Syst Sci 49:454-477 (1994)Google Scholar
  4. 4.
    Chvátal V: A Greedy Heuristic for the Set-Covering Problem. Math Oper Res 4(3):233-235 (1979)Google Scholar
  5. 5.
    Chvátal V: Linear Programming. W.H. Freeman and Company, 1983Google Scholar
  6. 6.
    Dubhashi D, Mei A, Panconesi A, Radhakrishnan J, Srinivasan A: Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp 717-724Google Scholar
  7. 7.
    Feige U: A Threshold of \(\ln n\) for Approximating Set Cover. J. ACM (JACM) 45(4):634-652 (1998)Google Scholar
  8. 8.
    Gao J, Guibas L, Hershberger J, Zhang L, Zhu A: Discrete Mobile Centers. In: Proc. of the 17th annual symposium on Computational geometry (SCG), ACM Press, 2001, pp 188-196Google Scholar
  9. 9.
    Garey MR, Johnson DS: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979Google Scholar
  10. 10.
    Guha S, Khuller S: Approximation Algorithms for Connected Dominating Sets. In: Proc. of the 4th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol 1136, 1996, pp 179-193Google Scholar
  11. 11.
    Jia L, Rajaraman R, Suel R: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001, pp 33-42Google Scholar
  12. 12.
    Johnson DS: Approximation Algorithms for Combinatorial Problems. J Comput Syst Sci 9:256-278 (1974)Google Scholar
  13. 13.
    Karp RM: Reducibility Among Combinatorial Problems. In: Proc. of a Symposium on the Complexity of Computer Computations, 1972, pp 85-103Google Scholar
  14. 14.
    Kuhn F, Moscibroda T, Wattenhofer R: What Cannot Be Computed Locally! In: Proc. of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp 300-309Google Scholar
  15. 15.
    Kutten S, Peleg D: Fast Distributed Construction of Small k-Dominating Sets and Applications. J Algorithms 28:40-66 (1998)Google Scholar
  16. 16.
    Lovasz L: On the Ratio of Optimal Integral and Fractional Covers. Discrete Math 13:383-390 (1975)Google Scholar
  17. 17.
    Luby M, Nisan N: A Parallel Approximation Algorithm for Positive Linear Programming. In: Proc. of the 25th ACM Symposium on Theory of Computing (STOC), 1993, pp 448-457Google Scholar
  18. 18.
    Raghavan P, Thompson CD: Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica 7(4):365-374 (1987)Google Scholar
  19. 19.
    Rajagopalan S, Vazirani V: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM J Comput 28:525-540 (1998)Google Scholar
  20. 20.
    Rajaraman R: Topology Control and Routing in Ad hoc Networks: A Survey. SIGACT News 33:60-73 (2002)Google Scholar
  21. 21.
    Slav\’ik P: A Tight Analysis of the Greedy Algorithm for Set Cover. In: Proc. of the 28th ACM Symposium on Theory of Computing (STOC), 1996, pp 435-441Google Scholar
  22. 22.
    Wu J, Li H: 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), 1999, pp 7-14Google Scholar

Copyright information

© Springer-Verlag Berlin/Heidelberg 2005

Authors and Affiliations

  1. 1.Computer Engineering and Networks LaboratoryETH ZürichZürichSwitzerland

Personalised recommendations