{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T14:18:22Z","timestamp":1776694702525,"version":"3.51.2"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1016\/0020-0190(86)90062-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"151-156","source":"Crossref","is-referenced-by-count":33,"title":["Exact computation of Steiner minimal trees in the plane"],"prefix":"10.1016","volume":"22","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[]},{"given":"D.E.","family":"Hewgill","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90062-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(86)90062-1_BIB2","article-title":"Steiner 72\u2014An improved version of Cockayne and Schiller's program Steiner for the minimal network problem","author":"Boyce","year":"1975"},{"key":"10.1016\/0020-0190(86)90062-1_BIB3","unstructured":"W.M. Boyce and J.B. Seery, Steiner 73, Private communication."},{"issue":"1","key":"10.1016\/0020-0190(86)90062-1_BIB4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/0118014","article-title":"On the efficiency of the algorithm for Steiner Minimal Trees","volume":"18","author":"Cockayne","year":"1970","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(86)90062-1_BIB5","series-title":"Combinatorics","first-page":"52","article-title":"Computation of Steiner Minimal Trees","author":"Cockayne","year":"1972"},{"issue":"4","key":"10.1016\/0020-0190(86)90062-1_BIB6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","article-title":"The complexity of computing Steiner Minimal Trees","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(86)90062-1_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4153\/CMB-1961-016-2","article-title":"On the problem of Steiner","volume":"4","author":"Melzak","year":"1961","journal-title":"Can. Math. Bull."},{"key":"10.1016\/0020-0190(86)90062-1_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","article-title":"An O(n log n) heuristic for Steiner Minimal Tree problems on the Euclidean metric","volume":"11","author":"Smith","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0020-0190(86)90062-1_BIB9","article-title":"The Steiner problem","author":"Winter","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:28:56Z","timestamp":1553578136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0020019086900621"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90062-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}