{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:57Z","timestamp":1759639017061},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,21]],"date-time":"2009-05-21T00:00:00Z","timestamp":1242864000000},"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,11]]},"DOI":"10.1007\/s10878-009-9229-6","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T16:10:57Z","timestamp":1242835857000},"page":"342-349","source":"Crossref","is-referenced-by-count":42,"title":["Node-weighted Steiner tree approximation in\u00a0unit disk\u00a0graphs"],"prefix":"10.1007","volume":"18","author":[{"given":"Feng","family":"Zou","sequence":"first","affiliation":[]},{"given":"Xianyue","family":"Li","sequence":"additional","affiliation":[]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"key":"9229_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"YP Aneja","year":"1980","unstructured":"Aneja YP (1980) An integer linear programming approach to the Steiner problem in graphs. Networks 10:167\u2013178","journal-title":"Networks"},{"key":"9229_CR2","first-page":"27","volume":"25","author":"R Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda R, Even S (1985) A local-ratio theorem for approximating the weighted vertex cover problem. Anal Des Algorithms Comb Probl 25:27\u201346","journal-title":"Anal Des Algorithms Comb Probl"},{"key":"9229_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","volume":"14","author":"JE Beasley","year":"1984","unstructured":"Beasley JE (1984) An algorithm for the Steiner problem in graphs. Networks 14:147\u2013159","journal-title":"Networks"},{"key":"9229_CR4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P Berman","year":"1994","unstructured":"Berman P, Ramaiyer V (1994) Improved approximations for the Steiner tree problem. J Algorithms 17:381\u2013408","journal-title":"J Algorithms"},{"key":"9229_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(00)00182-1","volume":"262","author":"D Chen","year":"2001","unstructured":"Chen D, Du DZ, Hu XD, Lin GH, Wang L, Xue G (2001) Approximation for Steiner tree with minimum number of Steiner points. Theor Comput Sci 262:83\u201399","journal-title":"Theor Comput Sci"},{"key":"9229_CR6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of lnn for approximating set cover. J ACM 45:634\u2013652","journal-title":"J ACM"},{"key":"9229_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Fransisco"},{"key":"9229_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:57\u201374","journal-title":"Inf Comput"},{"key":"9229_CR9","volume-title":"Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms","author":"E Halperin","year":"2000","unstructured":"Halperin E (2000) Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms. ACM-SIAM, New York"},{"key":"9229_CR10","unstructured":"Hougardy S, Pr\u00f6mel HJ (1998) A 1.598 approximation algorithm for the Steiner problem in graphs. In: SODA, pp 448\u2013453"},{"key":"9229_CR11","doi-asserted-by":"crossref","unstructured":"Huang Y, Gao X, Zhang Z, Wu W (2009) A better constant-factor approximation for weighted dominating set in unit disk graph. Preprint","DOI":"10.1007\/s10878-008-9146-0"},{"key":"9229_CR12","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P Klein","year":"1995","unstructured":"Klein P, Ravi R (1995) A nearly best-possible approximation algorithm for node-weighted Steiner trees. J\u00a0Algorithms 19:104\u2013115","journal-title":"J\u00a0Algorithms"},{"key":"9229_CR13","doi-asserted-by":"crossref","unstructured":"Kou LT, Markowsky G, Berman L (1981) In: A fast algorithm for Steiner trees, pp 141\u2013145","DOI":"10.1007\/BF00288961"},{"key":"9229_CR14","unstructured":"Nieberg T, Hurink J (2005) A PTAS for the minimum dominating set problem in unit disk graphs. In: WAOA, pp 296\u2013306"},{"key":"9229_CR15","unstructured":"Robins G, Zelikovski A (2000) Improved Steiner tree approximation in graphs. In: Proceedings of the 11th ACM-SIAM symposium on discrete algorithms, pp 770\u2013779"},{"key":"9229_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A Segev","year":"1987","unstructured":"Segev A (1987) The node-weighted Steiner tree problem. Networks 17:1\u201317","journal-title":"Networks"},{"key":"9229_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230120309","volume":"12","author":"ML Shore","year":"1982","unstructured":"Shore ML, Foulds LR, Gibbons RB (1982) An algorithm for the Steiner problem in graphs. Networks 12:323\u2013333","journal-title":"Networks"},{"key":"9229_CR18","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A Zelikovsky","year":"1993","unstructured":"Zelikovsky A (1993) An 11\/6 approximation algorithm for the network Steiner problem. Algorithmica 9:463\u2013470","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9229-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9229-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9229-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9229-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,21]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9229"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9229-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,21]]}}}