1.

Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, A Guide to the Theory of NP-Completeness, New York (1979)

2.

Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Disc. Math.

**86**, 165–177 (1990)

CrossRefMATHMathSciNetGoogle Scholar3.

Feige, U.: A threshold of \(\ln n\) for approximating set-cover. Proceedings of the 28th ACM Symposium on Theory of Computing, New york. pp. 314–318 (1996)

4.

Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica

**20**, 374–387 (1998)

CrossRefMATHMathSciNetGoogle Scholar5.

Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker Inc., New York (1998)

MATHGoogle Scholar6.

Wan, P., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Proceedings of the 21th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1597–1604 (2002)

7.

Cheng, X., Huang, X., Li, D., Wu, W., Du, D.Z.: Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks

**42**(4), 202–208 (2003)

CrossRefMATHMathSciNetGoogle Scholar8.

Bao, L., Garcia-Luna-Aceves, J.J.: Topology management in ad hoc networks. Proceedings of the 4th ACM international symposium on Mobile ad hoc networking& computing, pp. 129–140 (2003)

9.

Mohammed, K., Gewali, L., Muthukumar, V.: Generating quality dominating sets for sensor network. Proceedings of the 6th International Conference on Computational Intelligence and Multimedia Applications, pp. 204–211 (2005)

10.

Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless network. J. Parallel Distrib. Comput.

**66**(7), 946–958 (2005)

Google Scholar11.

Wu, W., Du, H., Jia, X., Li, Y., Huang, S.C.H.: Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor. Comput. Sci.

**352**(1–3), 1–7 (2006)

CrossRefMATHMathSciNetGoogle Scholar12.

Wu, Y., Wang, F., Thai, M.T., Li, Y.: Constructing k-connected m-dominating sets in wireless sensor networks. Proceedings of Military Communications Conference, pp. 1–7 (2007)

13.

Thai, M., Zhang, N., Tiwari, R., Xu, X.: On approximation algorithms of k-connected m-dominating sets in disk graphs. Theor. Comput. Sci.

**358**(1–3), 49–59 (2007)

CrossRefMathSciNetGoogle Scholar14.

Thai, M., Wang, F., Liu, D., Zhu, S., Du, D.Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobile Comput.

**6**(7), 721–730 (2007)

CrossRefGoogle Scholar15.

Xing, K., Cheng, W., Park, E.K., Rotenstreich, S.: Distributed connected dominating set construction in geometric k-disk graphs. Proceedings of the 28th IEEE International Conference on Distributed, Computing Systems, pp. 673–680 (2008)

16.

Wang, F., Thai, M.T., Du, D.Z.: 2-Connected virtual backbone in wireless network. IEEE Trans. Wirel. Commun.

**8**(3), 1230–1237 (2009)

CrossRefGoogle Scholar17.

Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.Z.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Systems

**20**(2), 147–157 (2009)

CrossRefGoogle Scholar18.

Kim, D., Zhang, Z., Li, X., Wang, W., Wu, W., Du, D.Z.: A better approximation algorithm for computing connected dominating sets in unit ball graphs. IEEE Trans. Mobile Comput.

**9**(8), 1108–1118 (2010)

Google Scholar19.

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. Proceedings of the 29th Annual Joint Conference of IEEE Communication and Computer Society, pp. 2739–2747 (2010)

20.

Wang, L., Wan, P., Yao, F.F.: Minimum CDS in multihop wireless networks with disparate communication ranges. Proceedings of the 5th International Conference on Wireless algorithms, Systems, and Applications, pp. 47–56 (2010)

21.

Ding, L., Wu, W., Willson, J., Du, H., Lee, W., Du, D.Z.: Efficient algorithms for topology control problem with routing cost constraints in wireless networks. IEEE Trans. Parallel Distrib. Systems

**22**(10), 1601–1609 (2011)

CrossRefGoogle Scholar22.

Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D.Z., Howard, S.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireleess sensor netowrks. Proceedings of 30th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1737–1744 (2011)

23.

Ding, L., Wu, W., Willson, J.K., Wu, L., Lu, Z., Lee, W.: Constant-approximation for target coverage problem in wireless sensor networks. Proceedings of 31th Annual Joint Conference of IEEE Communication and Computer Society, pp. 1584–1592 (2012)

24.

Du, H., Wu, W., Ye, Q., Li, W.D., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Systems