, Volume 80, Issue 11, pp 3270–3292 | Cite as

Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs

  • Takuro Fukunaga


Given an undirected graph on a node set V and positive integers k and m, a k-connected m-dominating set ((km)-CDS) is defined as a subset S of V such that each node in \(V{\setminus }S\) has at least m neighbors in S, and a k-connected subgraph is induced by S. The weighted (km)-CDS problem is to find a minimum weight (km)-CDS in a given node-weighted graph. The problem is called the unweighted (km)-CDS problem if the objective is to minimize the cardinality of a (km)-CDS. These problems have been actively studied for unit disk graphs, motivated by the application of constructing a virtual backbone in a wireless ad hoc network. In this paper, we consider the case in which \(k \le m\), and we present a simple \(O(k5^k)\)-approximation algorithm for the unweighted (km)-CDS problem, and a primal-dual \(O(k^2 \log k)\)-approximation algorithm for the weighted (km)-CDS problem.


Connected dominating set Unit disk graph Approximation algorithm 



The author thanks anonymous referees for their careful reading and many useful comments. This work was supported by JST ERATO Grant No. JPMJER1201, and JSPS KAKENHI Grant No. 17K00040.


  1. 1.
    Alzoubi, K.M., Wan, P.-J., Frieder, O.: Message-optimal connected dominating sets in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc ’02, pp. 157–164 (2002)Google Scholar
  2. 2.
    Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006. Proceedings, pp. 3–14 (2006)Google Scholar
  3. 3.
    Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. J. Comput. Geom. 7(1), 221–236 (2016)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1–6:33 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Chekuri, C., Ene, A., Vakilian, A.: Prize-collecting survivable network design in node-weighted graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques—Proceedings of the 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, pp. 98–109 (2012)Google Scholar
  6. 6.
    Cheng, X., Huang, X., Li, D., Weili, W., Ding-Zhu, D.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202–208 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Cicalese, F., Cordasco, G., Gargano, L., Milanic, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535, 1–15 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Cicalese, F., Milanic, M., Vaccaro, U.: On the approximability and exact algorithms for vector domination and related problems in graphs. Discrete Appl. Math. 161(6), 750–767 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless ad hoc and sensor networks. J. Parallel Distrib. Comput. 66(7), 947–958 (2006)CrossRefzbMATHGoogle Scholar
  11. 11.
    Fukunaga, T.: Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs. CoRR. arXiv:1511.09156 (2015)
  12. 12.
    Fukunaga, T.: Spider covers for prize-collecting network activation problem. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 9–24 (2015)Google Scholar
  13. 13.
    Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Netw. 2(3), 444–453 (2006)CrossRefGoogle Scholar
  14. 14.
    Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems, pp. 144–191. PWS Publishing Co. (1996)Google Scholar
  15. 15.
    Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374–387 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Inf. Comput. 150(1), 57–74 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kim, D., Wang, W., Li, X., Zhang, Z., Wu, W.: A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks. In: Proceedings of the 2010 IEEE Conference on Computer Communications, INFOCOM 2010, pp. 2739–2747 (2010)Google Scholar
  18. 18.
    Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104–115 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59–68 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Nutov, Z.: Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms 9(1), 1 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Shang, W., Yao, F., Wan, P., Xiaodong, H.: On minimum m-connected k-dominating set problem in unit disc graphs. J. Comb. Optim. 16(2), 99–106 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Shi, Y., Zhang, Y., Zhang, Z., Weili, W.: A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J. Comb. Optim. 31(1), 136–151 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Shi, Y., Zhang, Z., Du, D.-Z.: Approximation algorithm for minimum weight (k, m)-cds problem in unit disk graph. CoRR. arXiv:1508.05515 (2015)
  24. 24.
    Shi, Y., Zhang, Z., Mo, Y., Ding-Zhu, D.: Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE ACM Trans. Netw. 25(2), 925–933 (2017)CrossRefGoogle Scholar
  25. 25.
    Wang, F., Thai, M.T., Ding-Zhu, D.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Trans. Wirel. Commun. 8(3), 1230–1237 (2009)CrossRefGoogle Scholar
  26. 26.
    Wang, W., Kim, D., An, M.K., Gao, W., Li, X., Zhang, Z., Wu, W.: On construction of quality fault-tolerant virtual backbone in wireless networks. IEEE ACM Trans. Netw. 21(5), 1499–1510 (2013)CrossRefGoogle Scholar
  27. 27.
    Wang, W., Liu, B., Kim, D., Li, D., Wang, J., Jiang, Y.: A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition. In: Proceedings of the 2015 IEEE Conference on Computer Communications, INFOCOM 2015, pp. 1796–1804 (2015)Google Scholar
  28. 28.
    Willson, J., Zhang, Z., Wu, W., Du, D.-Z.: Fault-tolerant coverage with maximum lifetime in wireless sensor networks. In: Proceedings of the 2015 IEEE Conference on Computer Communications, INFOCOM 2015, pp. 1364–1372 (2015)Google Scholar
  29. 29.
    Yu, J., Jia, L., Yu, D., Li, G., Cheng, X.: Minimum connected dominating set construction in wireless networks under the beeping model. In: Proceedings of the 2015 IEEE Conference on Computer Communications, INFOCOM 2015, pp. 972–980 (2015)Google Scholar
  30. 30.
    Zhang, Z., Zhou, J., Mo, Y., Du, D.-Z.: Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks. In: 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, San Francisco, CA, USA, April 10–14, 2016, pp. 1–8 (2016)Google Scholar
  31. 31.
    Zou, F., Li, X., Gao, S., Weili, W.: Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18(4), 342–349 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Zou, F., Wang, Y., XiaoHua, X., Li, X., Hongwei, D., Wan, P.-J., Weili, W.: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor. Comput. Sci. 412(3), 198–208 (2011)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.National Institute of InformaticsTokyoJapan
  2. 2.JST, ERATO, Kawarabayashi Large Graph ProjectTokyoJapan

Personalised recommendations