{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:33Z","timestamp":1725570453718},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_4","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"15-24","source":"Crossref","is-referenced-by-count":0,"title":["A 3\/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, A., Klein, P.N., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner tree problem on networks. In: STOC, pp. 134\u2013144 (1991)","DOI":"10.1145\/103418.103437"},{"key":"4_CR2","series-title":"LNCS","first-page":"86","volume-title":"WADS 2009","author":"P. Berman","year":"2009","unstructured":"Berman, P., Karpinski, M., Zelikovsky, A.: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. In: Dehne, F., et al. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 86\u201397. Springer, Heidelberg (2009)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Processing letters"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: An improved LP-based approximation for Steiner tree. In: STOC (to appear, 2010)","DOI":"10.1145\/1806689.1806769"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1007\/3-540-45465-9_83","volume-title":"Automata, Languages and Programming","author":"A. Czumaj","year":"2002","unstructured":"Czumaj, A., Lingas, A., Zhao, H.: Polynomial-time approximation schemes for the Euclidean survivable network design problem. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 973\u2013984. Springer, Heidelberg (2002)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/0020739830140103","volume":"14","author":"V.J. Rayward-Smith","year":"1983","unstructured":"Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Internat. J. Math. Educ. Sci. Tech.\u00a014, 15\u201323 (1983)","journal-title":"Internat. J. Math. Educ. Sci. Tech."},{"key":"#cr-split#-4_CR7.1","doi-asserted-by":"crossref","unstructured":"Robins, A.Z.: Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics\u00a019(1), 122\u2013134 (2005);","DOI":"10.1137\/S0895480101393155"},{"key":"#cr-split#-4_CR7.2","unstructured":"Preliminary version appeared in Proc. SODA 2000, pp. 770\u2013779 (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:05:36Z","timestamp":1553274336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}