{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T17:56:25Z","timestamp":1682099785484},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T00:00:00Z","timestamp":1273017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11590-010-0194-x","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T03:55:56Z","timestamp":1272945356000},"page":"405-416","source":"Crossref","is-referenced-by-count":4,"title":["Approximations for node-weighted Steiner tree in unit disk graphs"],"prefix":"10.1007","volume":"4","author":[{"given":"X.","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.-J.","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,5]]},"reference":[{"issue":"3","key":"194_CR1","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A. Borchers","year":"1997","unstructured":"Borchers A., Du D.-Z.: The k-Steiner ratio in graphs. SIAM J. Comput. 26(3), 857\u2013869 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"194_CR2","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.: Improved approximations for the Steiner tree problem. J. Algorithms 17(3), 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"key":"194_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4613-0255-1_7","volume-title":"Steiner trees in Industry","author":"C. Gr\u00f6pl","year":"2001","unstructured":"Gr\u00f6pl C., Hougardy S., Nierhoff T., Pr\u00f6mel H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Cheng, X., Du, D.-Z. (eds) Steiner trees in Industry, pp. 235\u2013279. Kluwer, Dordrecht (2001)"},{"issue":"1","key":"194_CR4","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.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Inf. Comput. 150(1), 57\u201374 (1999)","journal-title":"Inf. Comput."},{"issue":"1","key":"194_CR5","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.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms 19(1), 104\u2013115 (1995)","journal-title":"J. Algorithms"},{"key":"194_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou C.H., Vazirani U.V.: On two geometric problems relating to the traveling salesman problem. J. Algorithms 5, 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"issue":"1","key":"194_CR7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G. Robins","year":"2005","unstructured":"Robins G., Zelikovsky A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discrete Math. 19(1), 122\u2013134 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"194_CR8","doi-asserted-by":"crossref","unstructured":"Wan, P.-J., Du, D.-Z., Pardalos, P., Wu, W.: Greedy approximations for minimum submodular cover with submodular cost. Comput. Optim. Appl. (2009) (to appear)","DOI":"10.1007\/s10589-009-9269-y"},{"key":"194_CR9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky A.: The 11\/6-approximation algorithm for the Steiner problem on networks. Algorithmica 9, 463\u2013470 (1993)","journal-title":"Algorithmica"},{"key":"194_CR10","unstructured":"Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical Report CS-96-06, Department of Computer Science, University of Virginia (1996)"},{"key":"194_CR11","doi-asserted-by":"crossref","unstructured":"Zou, F., Li, X., Kim, D., Wu, W.: Two Constant Approximation Algorithms for Node-Weighted Steiner tree in Unit Disk Graphs. Lecture Notes in Computer Science, vol. 5165, pp. 278\u2013285. COCOA (2008)","DOI":"10.1007\/978-3-540-85097-7_26"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0194-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0194-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0194-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:04Z","timestamp":1559574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0194-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0194-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,5]]}}}