{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:35:33Z","timestamp":1777502133995,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T00:00:00Z","timestamp":1270684800000},"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":[[2011,11]]},"DOI":"10.1007\/s10878-010-9315-9","type":"journal-article","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T14:12:42Z","timestamp":1270649562000},"page":"663-673","source":"Crossref","is-referenced-by-count":8,"title":["PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs"],"prefix":"10.1007","volume":"22","author":[{"given":"Lidan","family":"Fan","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,8]]},"reference":[{"key":"9315_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 algorithm for NP-complete problems on planar graphs. J ACM 41:153\u2013180","journal-title":"J ACM"},{"key":"9315_CR2","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":"9315_CR3","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 (2005) Polynomial-time approximation schemes for geometric intersection graphs. SIAM J Comput 34:1302\u20131323","journal-title":"SIAM J Comput"},{"key":"9315_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(01)00138-7","volume":"79","author":"T Fujito","year":"2001","unstructured":"Fujito T (2001) On approximability of the independent\/connected edge dominating set problems. Inf Process Lett 79:261\u2013266","journal-title":"Inf Process Lett"},{"key":"9315_CR5","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. Freeman, New York"},{"key":"9315_CR6","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:57\u201374","journal-title":"Inf Comput"},{"key":"9315_CR7","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 ACM 32:130\u2013136","journal-title":"J ACM"},{"key":"9315_CR8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"PN Klein","year":"1995","unstructured":"Klein PN, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. J Algorithms 19:104\u2013114","journal-title":"J Algorithms"},{"key":"9315_CR9","doi-asserted-by":"crossref","unstructured":"Kratochvil J (1997). Intersection graphs of noncrossing arc-connected sets in the plane. In: Proc. symposium on graph drawing, GD\u201996. LNCS, vol\u00a01190, pp\u00a0257\u2013270","DOI":"10.1007\/3-540-62495-3_53"},{"key":"9315_CR10","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.jpdc.2005.10.007","volume":"66","author":"XY Li","year":"2006","unstructured":"Li XY, Wang Y (2006) Simple approximation algorithms and PTASs for various problems in wireless ad-hoc networks. J Parallel Distrib Comput 66:515\u2013530","journal-title":"J Parallel Distrib Comput"},{"key":"9315_CR11","unstructured":"Li XY, Xu XH, Zou F, Du HW, Wan PJ, Wang YX, Wu WL (2009) A PTAS for node-weighted teiner tree in unit disk graphs. In: COCOA, 2009. LNCS, vol\u00a05573, pp\u00a036\u201348"},{"key":"9315_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H","volume":"28","author":"L Wang","year":"1996","unstructured":"Wang L, Jiang T (1996) An approximation scheme for some Steiner tree problems in the plane. Networks 28:187\u2013193","journal-title":"Networks"},{"key":"9315_CR13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"RB Yehuda","year":"1981","unstructured":"Yehuda RB, Even S (1981) A linear-time approximation algorithm for the weighted vertex cover problem. J Algorithms 2:198\u2013203","journal-title":"J Algorithms"},{"key":"9315_CR14","first-page":"27","volume":"25","author":"RB Yehuda","year":"1985","unstructured":"Yehuda RB, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Ann Discrete Math 25:27\u201346","journal-title":"Ann Discrete Math"},{"key":"9315_CR15","doi-asserted-by":"crossref","first-page":"5398","DOI":"10.1016\/j.tcs.2009.01.035","volume":"410","author":"Z Zhang","year":"2009","unstructured":"Zhang Z, Gao XF, Wu WL (2009) PTAS for connected vertex cover in unit disk graphs. Theor Comput Sci 410:5398\u20135402","journal-title":"Theor Comput Sci"},{"key":"9315_CR16","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s10878-009-9229-6","volume":"18","author":"F Zou","year":"2009","unstructured":"Zou F, Li XY, Gao SG, Wu WL (2009) Node-weighted Steiner tree approximation in unit disk graphs. J\u00a0Comb Optim 18:342\u2013349","journal-title":"J\u00a0Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9315-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9315-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9315-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:16Z","timestamp":1559261896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9315-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,8]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9315"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9315-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,8]]}}}