{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:20:01Z","timestamp":1773796801831,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0020-0190(89)90039-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"171-176","source":"Crossref","is-referenced-by-count":259,"title":["The Steiner problem with edge lengths 1 and 2"],"prefix":"10.1016","volume":"32","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]},{"given":"Paul","family":"Plassmann","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90039-2_BIB1","article-title":"Approximation bounds for special cases of the Steiner problem","author":"Bern","year":"1989","journal-title":"Manuscript in preparation"},{"key":"10.1016\/0020-0190(89)90039-2_BIB2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","article-title":"A new bound for Euclidean Steiner minimal trees","volume":"440","author":"Chung","year":"1985","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"10.1016\/0020-0190(89)90039-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","article-title":"Steiner minimal trees","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(89)90039-2_BIB4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(89)90039-2_BIB5","first-page":"147","article-title":"An even faster approximation algorithm for the Steiner tree problem in graphs","volume":"59","author":"Kou","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0020-0190(89)90039-2_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","article-title":"A faster approximation algorithm for the Steiner problem in graphs","volume":"27","author":"Mehlhorn","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90039-2_BIB7","first-page":"341","article-title":"Some further approximation algorithms for the vertex cover problem","volume":"159","author":"Monien","year":"1983"},{"key":"10.1016\/0020-0190(89)90039-2_BIB8","first-page":"229","article-title":"Optimization, approximation, and complexity classes","author":"Papadimitriou","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(89)90039-2_BIB9","author":"Papadimitriou","year":"1989","journal-title":"Manuscript in preparation"},{"key":"10.1016\/0020-0190(89)90039-2_BIB10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","article-title":"The computation of nearly minimal Steiner trees in graphs","volume":"14","author":"Rayward-Smith","year":"1983","journal-title":"Internat. J. Math. Educ. Sci. Tech."},{"key":"10.1016\/0020-0190(89)90039-2_BIB11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(88)90225-6","article-title":"Worst-case performance of Rayward-Smith's Steiner tree heuristic","volume":"29","author":"Waxman","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90039-2_BIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: a survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900392?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089900392?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:57:15Z","timestamp":1555073835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089900392"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0020019089900392"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90039-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}