{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T12:23:11Z","timestamp":1707999791278},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0167-6377(92)90053-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"271-274","source":"Crossref","is-referenced-by-count":2,"title":["A simple proof of the planar rectilinear Steiner ratio"],"prefix":"10.1016","volume":"12","author":[{"given":"Jeffrey S.","family":"Salowe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90053-6_bib1","series-title":"Proc. 3rd Annual Symposium on Discrete Algorithms","first-page":"325","article-title":"Improved approximations for the Steiner tree problem","author":"Berman","year":"1992"},{"key":"10.1016\/0167-6377(92)90053-6_bib2","author":"Du","year":"1991","journal-title":"Steiner minimum trees on a normed space"},{"key":"10.1016\/0167-6377(92)90053-6_bib3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","article-title":"A proof of the Gilbert-Pollak conjecture on the Steiner ratio","volume":"7","author":"Du","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/0167-6377(92)90053-6_bib4","series-title":"Proc. 32nd Annual Symposium on Foundations of Computer Science","first-page":"431","article-title":"On better heuristic for Euclidean steiner minimum trees","author":"Du","year":"1991"},{"key":"10.1016\/0167-6377(92)90053-6_bib5","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. of Appl. Math."},{"key":"10.1016\/0167-6377(92)90053-6_bib6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BF02067241","article-title":"A simple proof of Hwang's theorem for rectilinear Steiner minimal trees","volume":"33","author":"Richards","year":"1991","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0167-6377(92)90053-6_bib7","doi-asserted-by":"crossref","unstructured":"A.Z. Zelikovsky, \u201cThe 11\/6 approximation algorithm for the Steiner problem on networks\u201d, Inform. and Comput. (to appear).","DOI":"10.1007\/BF01187035"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900536?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900536?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:50:50Z","timestamp":1552888250000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0167637792900536"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90053-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}