{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:26:34Z","timestamp":1761895594859,"version":"3.40.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,11,25]],"date-time":"2012-11-25T00:00:00Z","timestamp":1353801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s11590-012-0590-5","type":"journal-article","created":{"date-parts":[[2012,11,24]],"date-time":"2012-11-24T07:15:21Z","timestamp":1353741321000},"page":"425-434","source":"Crossref","is-referenced-by-count":9,"title":["Routing-efficient CDS construction in Disk-Containment Graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Zaixin","family":"Lu","sequence":"first","affiliation":[]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Eugene","family":"Maslov","sequence":"additional","affiliation":[]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,25]]},"reference":[{"key":"590_CR1","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. Freeman, A Guide to the Theory of NP-Completeness, New York (1979)"},{"key":"590_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B Clark","year":"1990","unstructured":"Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Disc. Math. 86, 165\u2013177 (1990)","journal-title":"Disc. Math."},{"key":"590_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"key":"590_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"590_CR5","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Marcel Dekker Inc., New York (1998)"},{"key":"590_CR6","unstructured":"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\u20131604 (2002)"},{"issue":"4","key":"590_CR7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"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\u2013208 (2003)","journal-title":"Networks"},{"key":"590_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013140 (2003)","DOI":"10.1145\/778430.778432"},{"key":"590_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013211 (2005)","DOI":"10.1109\/ICCIMA.2005.33"},{"issue":"7","key":"590_CR10","first-page":"946","volume":"66","author":"F Dai","year":"2005","unstructured":"Dai, F., Wu, J.: On constructing k-connected k-dominating set in wireless network. J. Parallel Distrib. Comput. 66(7), 946\u2013958 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1\u20133","key":"590_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"W Wu","year":"2006","unstructured":"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\u20133), 1\u20137 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"590_CR12","doi-asserted-by":"crossref","unstructured":"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\u20137 (2007)","DOI":"10.1109\/MILCOM.2007.4454774"},{"issue":"1\u20133","key":"590_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.tcs.2007.05.025","volume":"358","author":"M Thai","year":"2007","unstructured":"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\u20133), 49\u201359 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"590_CR14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"M Thai","year":"2007","unstructured":"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\u2013730 (2007)","journal-title":"IEEE Trans. Mobile Comput."},{"key":"590_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013680 (2008)","DOI":"10.1109\/ICDCS.2008.39"},{"issue":"3","key":"590_CR16","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/TWC.2009.051053","volume":"8","author":"F Wang","year":"2009","unstructured":"Wang, F., Thai, M.T., Du, D.Z.: 2-Connected virtual backbone in wireless network. IEEE Trans. Wirel. Commun. 8(3), 1230\u20131237 (2009)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"2","key":"590_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"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\u2013157 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"590_CR18","doi-asserted-by":"crossref","unstructured":"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\u20131118 (2010)","DOI":"10.1109\/TMC.2010.55"},{"key":"590_CR19","doi-asserted-by":"crossref","unstructured":"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\u20132747 (2010)","DOI":"10.1109\/INFCOM.2010.5462105"},{"key":"590_CR20","doi-asserted-by":"crossref","unstructured":"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\u201356 (2010)","DOI":"10.1007\/978-3-642-14654-1_6"},{"issue":"10","key":"590_CR21","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TPDS.2011.30","volume":"22","author":"L Ding","year":"2011","unstructured":"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\u20131609 (2011)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"590_CR22","doi-asserted-by":"crossref","unstructured":"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\u20131744 (2011)","DOI":"10.1109\/INFCOM.2011.5934967"},{"key":"590_CR23","doi-asserted-by":"crossref","unstructured":"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\u20131592 (2012)","DOI":"10.1109\/INFCOM.2012.6195527"},{"key":"590_CR24","unstructured":"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"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0590-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0590-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0590-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T17:23:20Z","timestamp":1745342600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0590-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,25]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["590"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0590-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2012,11,25]]}}}