{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:59:46Z","timestamp":1780358386877,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T00:00:00Z","timestamp":1286409600000},"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":[[2012,5]]},"DOI":"10.1007\/s10878-010-9357-z","type":"journal-article","created":{"date-parts":[[2010,10,6]],"date-time":"2010-10-06T19:19:03Z","timestamp":1286392743000},"page":"443-450","source":"Crossref","is-referenced-by-count":12,"title":["A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Xu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shan","family":"Shan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,10,7]]},"reference":[{"key":"9357_CR1","first-page":"3","volume-title":"Proc APPROX-RANDOM","author":"C Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl C, Erlebach T, Mihal\u00e1k M, Nunkesser M (2006) Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Proc APPROX-RANDOM, pp\u00a03\u201314"},{"key":"9357_CR2","first-page":"376","volume-title":"Proc of international conference on communications\u201997","author":"V Bharghavan","year":"1997","unstructured":"Bharghavan V, Das B (1997) Routing in ad hoc networks using minimum connected dominating sets. In: Proc of international conference on communications\u201997, Montreal, Canada (June 1997), pp 376\u2013380"},{"key":"9357_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86:165\u2013177","journal-title":"Discrete Math"},{"key":"9357_CR4","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 (2009) A 5+\u03b5-approximation algorithm for minimum weighted dominating set in unit disk graph. Theor Comput Sci 410:756\u2013765","journal-title":"Theor Comput Sci"},{"key":"9357_CR5","series-title":"LNCS","first-page":"59","volume-title":"ADHOC-NOW 2007","author":"B Gfeller","year":"2007","unstructured":"Gfeller B, Vicari E (2007) A faster distributed approximation scheme for the connected dominating set problems for growth-bounded graphs. In: Kranakis TE, Opatrny J (eds) ADHOC-NOW 2007. LNCS, vol\u00a04686. Springer, Berlin, pp\u00a059\u201373"},{"issue":"4","key":"9357_CR6","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected dominating sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"9357_CR7","unstructured":"Huang YC, Gao XF, Zhang Z, Wu WL (2008) A better constant-factor approximation for weighted dominating set in unit disk graph. J Comb Optim, 1573\u20132886"},{"key":"9357_CR8","series-title":"LNCS","first-page":"296","volume-title":"WAOA 2005","author":"T Nieberg","year":"2006","unstructured":"Nieberg T, Hurink J (2006) A PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach T, Persiano G (eds) WAOA 2005. LNCS, vol\u00a03879. Springer, Berlin, pp\u00a0296\u2013306"},{"key":"9357_CR9","volume-title":"Proc Infocom","author":"P Wan","year":"2002","unstructured":"Wan P, Alzoubi KM, Frieder O (2002) Distributed construction of connected dominating set in wireless ad hoc networks. In: Proc Infocom"},{"key":"9357_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1062689.1062692","volume-title":"Proc 6th ACM international symposium on mobile ad hoc networking and computing (MOBIHOC)","author":"Y Wang","year":"2005","unstructured":"Wang Y, Wang W, Li X-Y (2005) Distributed low-cost backbone formation for wireless ad hoc networks. In: Proc 6th ACM international symposium on mobile ad hoc networking and computing (MOBIHOC), pp 2\u201313"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9357-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9357-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9357-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,7]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["9357"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9357-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,7]]}}}