{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:19Z","timestamp":1774418119991,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T00:00:00Z","timestamp":1255046400000},"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":[[2010,8]]},"DOI":"10.1007\/s11590-009-0148-3","type":"journal-article","created":{"date-parts":[[2009,10,8]],"date-time":"2009-10-08T02:51:23Z","timestamp":1254970283000},"page":"321-333","source":"Crossref","is-referenced-by-count":15,"title":["A PTAS for minimum d-hop connected dominating set in growth-bounded graphs"],"prefix":"10.1007","volume":"4","author":[{"given":"Xiaofeng","family":"Gao","sequence":"first","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shiwei","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,10,9]]},"reference":[{"key":"148_CR1","unstructured":"Chen, G., Nocetti, F., Gonzalez, J., Stojmenovic, I.: Connectivity based k-hop clustering in wireless networks. In: Proceedings of the 35th Hawaii International Conference on System Sciences (2002)"},{"key":"148_CR2","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., Du D.: Polynomial-time approximation scheme for minimum CDS in ad hoc wireless networks. Networks 42, 202\u2013208 (2003)","journal-title":"Networks"},{"key":"148_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/wcm.378","volume":"6","author":"X. Cheng","year":"2006","unstructured":"Cheng X., Ding M., Du H., Jia X.: Virtual backbone construction in multihop ad hoc wireless networks. Wireless Commun. Mobile Comput. 6, 183\u2013190 (2006)","journal-title":"Wireless Commun. Mobile Comput."},{"key":"148_CR4","doi-asserted-by":"crossref","unstructured":"Cokuslu, D., Erciyes, K.: A hierarchical connected dominating set based clustering algorithm for mobile ad hoc networks. In: Proceedings of 15th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS2007, IEEE), pp. 61\u201366, October 24\u201326, Istanbul (2007)","DOI":"10.1109\/MASCOTS.2007.1"},{"key":"148_CR5","unstructured":"Gao, X., Li, X., Wu, W.: A Constant-factor approximation for d-hop connected dominating sets in unit disk graphs. IEEE Trans. Mobile Comput. (2008, submitted)"},{"key":"148_CR6","doi-asserted-by":"crossref","unstructured":"Gfeller, B.,Vicari, E.: A faster distributed approximation scheme for the connected dominating set problems for growth-bounded graphs. In: Proceedings of the 6th Ad-Hoc, Mobile, and Wireless Networks International Conference (ADHOC-NOW 2007). LNCS 4686, pp. 59\u201373. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74823-6_5"},{"key":"148_CR7","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Huynh, D.: Connected D-hop dominating sets in mobile ad hoc networks. In: Proceedings of Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, 1\u20138 April (2006)","DOI":"10.1109\/WIOPT.2006.1666454"},{"key":"148_CR8","doi-asserted-by":"crossref","unstructured":"Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. Third Workshop on Approximation and Online Algorithms: part of ALGO 2005 (WAOA 2005). LNCS 3879, pp. 296\u2013306, Springer, Berlin (2006)","DOI":"10.1007\/11671411_23"},{"key":"148_CR9","unstructured":"Nocetti, F., Gonzalez, J., Stojmenovic, I.: Connectivity based k-hop clustering in wireless networks. Telecommunication Syst. 22, 1\u20134, 205\u2013220 (2003)"},{"issue":"6","key":"148_CR10","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.comnet.2004.09.005","volume":"47","author":"M. Rieck","year":"2005","unstructured":"Rieck M., Pai S., Dhar S.: Distributed routing algorithms for multi-hop ad hoc networks using d-hop connected d-dominating sets. Comput. Netw. 47(6), 785\u2013799 (2005)","journal-title":"Comput. Netw."},{"key":"148_CR11","unstructured":"Shi, Z., Srimani, P.: A new adaptive distributed routing protocol using d-hop dominating sets for mobile ad hoc networks. In: Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA\u201904), Las Vegas, June 21\u201324 (2004)"},{"key":"148_CR12","doi-asserted-by":"crossref","unstructured":"Spohn, M., Garcia-Luna-Aceves, J.: Enhancing broadcast operations in ad hoc networks with two-hop connected dominating sets. In: Proceedings of the 1st IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS\u201904), October 24\u201327, Fort Lauderdale, Florida, USA (2004)","DOI":"10.1109\/MAHSS.2004.1392202"},{"key":"148_CR13","doi-asserted-by":"crossref","unstructured":"Vuong, T., Huynh, D.: Adapting d-hop dominating sets to topology changes in ad hoc networks. In: Proceedings Ninth International Conference on Computer Communications and Networks, pp. 348\u2013353 (2000)","DOI":"10.1109\/ICCCN.2000.885513"},{"issue":"5\u20136","key":"148_CR14","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s11036-008-0039-3","volume":"12","author":"S. Yau","year":"2007","unstructured":"Yau S., Gao W.: Multi-hop clustering based on neighborhood benchmark in mobile ad-hoc networks. Mobile Netw. Appl. 12(5\u20136), 381\u2013391 (2007)","journal-title":"Mobile Netw. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0148-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0148-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0148-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:03Z","timestamp":1559560503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0148-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0148-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,9]]}}}