Skip to main content
SpringerLink
Log in

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set

  • Conference paper
Automata, Languages, and Programming (ICALP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8573))

Included in the following conference series:

Abstract

This paper presents a near-optimal distributed approximation algorithm for the minimum-weight connected dominating set (MCDS) problem. We use the standard distributed message passing model called the CONGEST model in which in each round each node can send \(\mathcal{O}(\log n)\) bits to each neighbor. The presented algorithm finds an \(\mathcal{O}(\log n)\) approximation in \(\tilde{\mathcal{O}}(D+\sqrt{n})\) rounds, where D is the network diameter and n is the number of nodes. MCDS is a classical NP-hard problem and the achieved approximation factor \(\mathcal{O}(\log n)\) is known to be optimal up to a constant factor, unless P = NP. Furthermore, the \(\tilde{\mathcal{O}}(D+\sqrt{n})\) round complexity is known to be optimal modulo logarithmic factors (for any approximation), following [Das Sarma et al.—STOC’11].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2(2), 153–177 (2006)

    Article  MathSciNet  Google Scholar 

  2. Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: the Proceedings of the Int’l Symp. on Mobile Ad Hoc Net. and Comput, pp. 157–164 (2002)

    Google Scholar 

  3. Alzoubi, K.M., Wan, P.-J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS), pp. 3849–3855. IEEE (2002)

    Google Scholar 

  4. Berger, B., Rompel, J., Shor, P.W.: Efficient NC algorithms for set cover with applications to learning and geometry. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pp. 454–477 (1994)

    Google Scholar 

  5. Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and manets. In: Handbook of Combinatorial Optimization, pp. 329–369. Springer (2005)

    Google Scholar 

  6. Chen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile ad Hoc Networking & Computing, pp. 165–172. ACM (2002)

    Google Scholar 

  7. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)

    MATH  MathSciNet  Google Scholar 

  8. Cheng, X., Wang, F., Du., D.-Z.: Connected dominating set. In: Encyclopedia of Algorithms, pp. 1–99. Springer (2008)

    Google Scholar 

  9. Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908–920 (2004)

    Article  Google Scholar 

  10. Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: Proc. of the IEEE Int’l Conf. on Communications (ICC), vol. 1, pp. 376–380. IEEE (1997)

    Google Scholar 

  11. Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 363–372 (2011)

    Google Scholar 

  12. Das Sarma, A., Nanongkai, D., Pandurangan, G.: Fast distributed random walks. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 161–170 (2009)

    Google Scholar 

  13. Das Sarma, A., Nanongkai, D., Pandurangan, G., Tetali, P.: Efficient distributed random walks with applications. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 201–210 (2010)

    Google Scholar 

  14. Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 717–724 (2003)

    Google Scholar 

  15. Elkin, M.: Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 331–340 (2004)

    Google Scholar 

  16. Feige, U.: A threshold of ln n for approximating set cover (preliminary version). In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 314–318 (1996)

    Google Scholar 

  17. Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 1150–1162 (2012)

    Google Scholar 

  18. Garay, J., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. In: Proc. of the Symp. on Found. of Comp. Sci. FOCS (1993)

    Google Scholar 

  19. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  20. Ghaffari, M.: Near-optimal distributed approximation of minimum-weight connected dominating set, http://people.csail.mit.edu/ghaffari/papers/CDS.pdf

  21. Ghaffari, M., Kuhn, F.: Distributed minimum cut approximation. In: Proc. of the Int’l Symp. on Dist. Comp. (DISC), pp. 1–15 (2013)

    Google Scholar 

  22. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  23. Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and computation 150(1), 57–74 (1999)

    Article  MathSciNet  Google Scholar 

  24. Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 355–364 (2012)

    Google Scholar 

  25. Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 32–42 (2001)

    Google Scholar 

  26. Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms 19(1), 104–115 (1995)

    MATH  MathSciNet  Google Scholar 

  27. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally? In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 300–309 (2004)

    Google Scholar 

  28. Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 25–32 (2003)

    Google Scholar 

  29. Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 238–251 (1995)

    Google Scholar 

  30. Lenzen, C., Patt-Shamir, B.: Fast routing table construction using small messages: Extended abstract. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 381–390 (2013)

    Google Scholar 

  31. Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.-H., Wu, W.: Improving construction for connected dominating set with steiner tree in wireless sensor networks. Journal of Global Optimization 35(1), 111–119 (2006)

    MATH  MathSciNet  Google Scholar 

  32. Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proc. of the Symp. on Theory of Comp. (STOC) (to appear, 2014)

    Google Scholar 

  33. Nanongkai, D., Das Sarma, A., Pandurangan, G.: A tight unconditional lower bound on distributed randomwalk computation. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 257–266 (2011)

    Google Scholar 

  34. Peleg, D.: Distributed Computing: A Locality-sensitive Approach. In: Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2000)

    Google Scholar 

  35. Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), p. 253 (1999)

    Google Scholar 

  36. Pettie, S.: Distributed algorithms for ultrasparse spanners and linear size skeletons. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 253–262 (2008)

    Google Scholar 

  37. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 475–484 (1997)

    Google Scholar 

  38. Thurimella, R.: Sub-linear distributed algorithms for sparse certificates and biconnected components. In: The Proc. of the Int’l Symp. on Princ. of Dist. Comp. (PODC), pp. 28–37 (1995)

    Google Scholar 

  39. Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: The Proc. of IEEE Int’l Conf. on Computer Communications (INFOCOM), vol. 3, pp. 1597–1604 (2002)

    Google Scholar 

  40. Wu, J., Gao, M., Stojmenovic, I.: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. In: IEEE’s International Conference on Parallel Processing (ICPP), pp. 346–354 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIT, USA

    Mohsen Ghaffari

Authors
  1. Mohsen Ghaffari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, 85748, München, Germany

    Javier Esparza

  2. LIAFA, Université Paris Diderot-Paris 7, Case 7014, 75205, Paris Cedex 13, France

    Pierre Fraigniaud

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen, Denmark

    Thore Husfeldt

  4. Department Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK,

    Elias Koutsoupias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghaffari, M. (2014). Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43951-7_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43951-7_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43950-0

  • Online ISBN: 978-3-662-43951-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation