{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:51:05Z","timestamp":1769975465672,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642033667","type":"print"},{"value":"9783642033674","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_8","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"86-97","source":"Crossref","is-referenced-by-count":6,"title":["1.25-Approximation Algorithm for Steiner Tree Problem with Distances 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":"8_CR1","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":"8_CR2","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."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","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 Journal on Discrete Mathematics\u00a019(1), 122\u2013134 (2005); Preliminary version appeared in Proc. SODA 2000, pp. 770\u2013779","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02579169","volume":"6","author":"H.N. Gabow","year":"1986","unstructured":"Gabow, H.N., Stallmann, M.: An augmenting path algorithm for linear matroid parity. Combinatorica\u00a06, 123\u2013150 (1986)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:18:44Z","timestamp":1552094324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}