{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:45:00Z","timestamp":1767707100696},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"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":[[2009,8]]},"DOI":"10.1007\/s10878-008-9146-0","type":"journal-article","created":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T10:18:39Z","timestamp":1204280319000},"page":"179-194","source":"Crossref","is-referenced-by-count":69,"title":["A better constant-factor approximation for weighted dominating set in unit disk graph"],"prefix":"10.1007","volume":"18","author":[{"given":"Yaochun","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,1]]},"reference":[{"key":"9146_CR1","series-title":"LNCS","first-page":"3","volume-title":"Proceedings of the 9th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2006)","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: Proceedings of the 9th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2006). LNCS, vol 4110. Springer, Berlin, pp 3\u201314"},{"issue":"1","key":"9146_CR2","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 Assoc Comput Mach 41(1):153\u2013180","journal-title":"J Assoc Comput Mach"},{"key":"9146_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90086-6","volume":"9","author":"R Bar-Yehuda","year":"1984","unstructured":"Bar-Yehuda R, Moran S (1984) On approximation problems related to the independent set and vertex cover problem. Discrete Appl Math 9:1\u201310","journal-title":"Discrete Appl Math"},{"key":"9146_CR4","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"},{"issue":"1","key":"9146_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/JCN.2002.6596934","volume":"4","author":"WF Dai","year":"2002","unstructured":"Dai WF, Gao M, Stojmenovic I (2002) On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. J Commun Netw 4(1):59\u201370","journal-title":"J Commun Netw"},{"key":"9146_CR6","first-page":"314","volume-title":"Proc.\u00a028th ACM symposium on theory of computing","author":"U Feige","year":"1996","unstructured":"Feige U (1996) A Threshold of lnn for approximating set cover. In: Proc.\u00a028th ACM symposium on theory of computing. ACM, New York, pp 314\u2013318"},{"key":"9146_CR7","volume-title":"A guide to the theory of NP completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. In: A guide to the theory of NP completeness. Freeman, New York"},{"issue":"1","key":"9146_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S Guha","year":"1999","unstructured":"Guha S, Khuller S (1999) Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf Comput 150(1):57\u201374","journal-title":"Inf Comput"},{"issue":"1","key":"9146_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J Assoc Comput Mach 32(1):130\u2013136","journal-title":"J Assoc Comput Mach"},{"issue":"2","key":"9146_CR10","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"HB Hunt III","year":"1998","unstructured":"Hunt HB III, Marathe MV, Radhakrishnan V, Ravi SS, Rosenkrantz DJ, Stearns RE (1998) NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J Algorithms 26(2):238\u2013274","journal-title":"J Algorithms"},{"issue":"2","key":"9146_CR11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein D (1982) Planar formulae and their uses. SIAM J Comput 11(2):329\u2013343","journal-title":"SIAM J Comput"},{"key":"9146_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe MV, Breu H, Hunt HB III, Ravi SS, Rosenkrantz DJ (1995) Simple heuristics for unit disk graphs. Networks 25:59\u201368","journal-title":"Networks"},{"key":"9146_CR13","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"key":"9146_CR14","doi-asserted-by":"crossref","unstructured":"Wang Y, Li XY (2005) 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 (MobiHoc 2005), pp 2\u201313","DOI":"10.1145\/1062689.1062692"},{"key":"9146_CR15","doi-asserted-by":"crossref","unstructured":"Wu J, Li H (1999) On calculating connected dominating set for efficient routing in ad-hoc wireless networks. In: Proc. of the 3rd international workshop on discrete algorithms and methods for mobile computing and commun, pp 7\u201314","DOI":"10.1145\/313239.313261"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9146-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9146-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9146-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9146-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9146"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9146-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,1]]}}}