{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:18Z","timestamp":1774418118746,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,23]],"date-time":"2013-05-23T00:00:00Z","timestamp":1369267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9626-8","type":"journal-article","created":{"date-parts":[[2013,5,22]],"date-time":"2013-05-22T07:42:03Z","timestamp":1369208523000},"page":"18-26","source":"Crossref","is-referenced-by-count":10,"title":["PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Lidong","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ailan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonjun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,23]]},"reference":[{"key":"9626_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. J ACM 41: 153\u2013180","journal-title":"J ACM"},{"key":"9626_CR2","doi-asserted-by":"crossref","unstructured":"Burkhart M, Rickenbach PV, Wattenhofer R, Zollinger A (2004) Does topology control reduce interference? In: Proceedings of the 5th ACM international symposium on mobile Ad Hoc networking and, computing, (MobiHoc04), pp 919","DOI":"10.1145\/989459.989462"},{"key":"9626_CR3","doi-asserted-by":"crossref","unstructured":"Ding L, Gao X, Wu W, Lee W, Zhu X, Du D-Z (2010) Distributed construction of connected dominating sets with minimum routing cost in wireless network. In: 30th international conference on distributed computing systems, ICDCS","DOI":"10.1109\/ICDCS.2010.17"},{"issue":"10","key":"9626_CR4","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1109\/TPDS.2011.30","volume":"22","author":"L Ding","year":"2011","unstructured":"Ding L, Weili W, Willson J, Du H, Lee W, Du D-Z (2011) Efficient algorithms for topology control problem with minimum routing constraints in wireless networks. IEEE Transact Parallel Distrib Syst 22(10):1601\u20131609","journal-title":"IEEE Transact Parallel Distrib Syst"},{"key":"9626_CR5","volume-title":"Design and analysis of approximation algorithms","author":"D-Z Du","year":"2011","unstructured":"Du D-Z, Ko K-I, Hu X (2011) Design and analysis of approximation algorithms. Springer, New York"},{"issue":"2","key":"9626_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10898-010-9563-3","volume":"50","author":"H Du","year":"2011","unstructured":"Du H, Wu W, Lee W, Liu Q, Zhang Z, Du D-Z (2011) On minimum submodular cover with submodular cost. J Glob Optim 50(2):229\u2013234","journal-title":"J Glob Optim"},{"key":"9626_CR7","doi-asserted-by":"crossref","unstructured":"Du H, Ye Q, Weili W, Deying L, Du D-Z, Howard S (2011) Constant approximation for virtual backbone construction with guarantee routing cost in wireless sensor networks, IEEE INFOCOM","DOI":"10.1109\/INFCOM.2011.5934967"},{"key":"9626_CR8","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2011.10.010","volume":"447","author":"H Du","year":"2012","unstructured":"Du H, Ye Q, Zhong J, Wang Y, Lee W, Park H (2012) Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks. Theor Comput Sci 447:38\u201343","journal-title":"Theor Comput Sci"},{"key":"9626_CR9","volume-title":"A guide to the theory of NP-completeness. Computer and intractablity","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) A guide to the theory of NP-completeness. Computer and intractablity. Fressman, San Francisco"},{"key":"9626_CR10","doi-asserted-by":"crossref","unstructured":"Gfeller B, Vicari E (2007) A faster distributed approximation scheme for the connected dominating set problem for growth-bounded graphs, Lecture Notes in Computer Science, vol 4686. Springer, Berlin, pp 57\u201374","DOI":"10.1007\/978-3-540-74823-6_5"},{"key":"9626_CR11","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s11276-005-1769-9","volume":"11","author":"K Jain","year":"2005","unstructured":"Jain K, Padhye J, Padmanabhan VN, Liu LL (2005) Impact of interference on multi-hop wireless network performance. Wirel Netw 11:471\u2013487","journal-title":"Wirel Netw"},{"key":"9626_CR12","doi-asserted-by":"crossref","unstructured":"Kyasanur P, Vaidya NF (2005) Routing and interface assignment in multi-channel multi-interface wireless networks. In: Wireless communications and networking conference 2005 IEEE, vol 4, pp 2051\u20132056","DOI":"10.1109\/WCNC.2005.1424834"},{"key":"9626_CR13","doi-asserted-by":"crossref","unstructured":"Salem NB, Hubaux JP (2005) A fair scheduling for wireless mesh networks. In: The 1st IEEE workshop on wireless mesh networks, held in conjunction with SECON05, Santa Clara","DOI":"10.1201\/9781420031263-1"},{"issue":"2","key":"9626_CR14","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10589-009-9269-y","volume":"45","author":"P-J Wan","year":"2010","unstructured":"Wan P-J, Du D-Z, Pardalos PM, Wu W (2010) Greedy approximation for minimum submodular cover with submodular cost. Comput Optim Appl 45(2):463\u2013474","journal-title":"Comput Optim Appl"},{"issue":"4","key":"9626_CR15","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1142\/S1793830909000348","volume":"1","author":"J Willson","year":"2009","unstructured":"Willson J, Gao X, Qu Z, Zhu Y, Li Y, Wu W (2009) Efficient distributed algorithms for topology control problem with shortest path constraints. Discret Math Algorithm Appl 1(4):437\u2013462","journal-title":"Discret Math Algorithm Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9626-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9626-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9626-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,14]],"date-time":"2019-07-14T01:20:08Z","timestamp":1563067208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9626-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,23]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9626"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9626-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,23]]}}}