{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:55:21Z","timestamp":1774418121282,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T00:00:00Z","timestamp":1318982400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10898-011-9795-x","type":"journal-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T08:08:42Z","timestamp":1318925322000},"page":"641-648","source":"Crossref","is-referenced-by-count":11,"title":["PTAS for the minimum weighted dominating set in growth bounded graphs"],"prefix":"10.1007","volume":"54","author":[{"given":"Zhong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Joon-Mo","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Bhavani","family":"Thuraisingham","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,19]]},"reference":[{"key":"9795_CR1","doi-asserted-by":"crossref","unstructured":"Ambuehl, C., Erlebach, T., Mihalak, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proceedings of the 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS 4110, Springer, pp. 3\u201314 (2006)","DOI":"10.1007\/11830924_3"},{"issue":"2","key":"9795_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon N., Moshkovitz D., Safra M.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms (TALG) 2(2), 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"9795_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker B.S.: Approximation algorithms for NP-complete problems on planar graphs. JACM 41(1), 153\u2013180 (1994)","journal-title":"JACM"},{"issue":"1\u20132","key":"9795_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu H., Kirkpatrick D.G.: Unit disk graph recognition is NP-hard. Comput. Geom.: Theory Appl. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"1\u20133","key":"9795_CR5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark B.N., Colbourn C.J., Johnson D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"key":"9795_CR6","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.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42, 202\u2013208 (2003)","journal-title":"Networks"},{"issue":"8\u201310","key":"9795_CR7","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.tcs.2008.11.015","volume":"410","author":"D. Dai","year":"2009","unstructured":"Dai D., Yu C.: A 5+ epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor. Comput. Sci. 410(8\u201310), 756\u2013765 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9795_CR8","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach T., Jansen K., Seidel E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"key":"9795_CR9","doi-asserted-by":"crossref","unstructured":"Gao, X., Huang, Y., Zhang, Z., Wu, W.: $${(6 + \\varepsilon)}$$ -approximation for minimum weight dominating set in unit disk graphs. COCOON, pp. 551\u2013557 (2008)","DOI":"10.1007\/978-3-540-69733-6_54"},{"key":"9795_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/wcm.107","volume":"3","author":"X. Li","year":"2003","unstructured":"Li X.: Algorithmic, geometric and graphs issues in wireless networks. Wirel. Commun. Mobile Comput. 3, 119\u2013140 (2003)","journal-title":"Wirel. Commun. Mobile Comput."},{"issue":"4","key":"9795_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1383369.1383380","volume":"4","author":"T. Nieberg","year":"2008","unstructured":"Nieberg T., Hurink J., Kern W.: Approximation schemes for wireless networks. ACM Trans. Algorithms 4(4), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9795_CR12","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on theory of Computing (El Paso, Texas, United States, May 04\u201306, 1997). STOC \u201997. ACM, New York, NY, pp. 475\u2013484 (1997)"},{"key":"9795_CR13","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1070\/IM1988v030n03ABEH001034","volume":"30","author":"A.L. Vol\u2019berg","year":"1988","unstructured":"Vol\u2019berg A.L., Konyagin S.V.: On measures with the doubling condition. Math. USSR Izvestiya 30, 629\u2013638 (1988)","journal-title":"Math. USSR Izvestiya"},{"issue":"5","key":"9795_CR14","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1090\/S0002-9939-98-04317-2","volume":"126","author":"J. Wu","year":"1998","unstructured":"Wu J.: Hausdoff dimension and doubling measures on metric spaces. Proc. Am. Math. Soc. 126(5), 1453\u20131459 (1998)","journal-title":"Proc. Am. Math. Soc."},{"key":"9795_CR15","unstructured":"Wang, Y., Wang, W., Li, X.: Distributed low-cost backbone formation for wireless ad hoc networks. In: Proceedings of the 6th ACM international Symposium on Mobile Ad Hoc Networking and Computing (Urbana-Champaign, IL, USA, May 25\u201327, 2005). MobiHoc \u201905. ACM, New York, NY, pp. 2\u201313 (2005)"},{"key":"9795_CR16","unstructured":"Zou, F., Wang, Y., Li, X., Xu, X., Du, H., Wan, P., Wu, W.: New Approximations for Minimum-Weighted Dominating Set and Minimum-Weighted Connected Dominating Set on Unit Disk Graphs, to appear in Theoretical Computer Science"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9795-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9795-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9795-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T18:25:57Z","timestamp":1560795957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9795-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,19]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9795"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9795-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,19]]}}}