{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T21:34:11Z","timestamp":1774042451064,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP210103476"],"award-info":[{"award-number":["DP210103476"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.comgeo.2026.102268","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:11:56Z","timestamp":1773159116000},"page":"102268","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An improved exact algorithm for the Euclidean k-Steiner tree problem"],"prefix":"10.1016","volume":"135","author":[{"given":"Jae","family":"Lee","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Brazil","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9986-2767","authenticated-orcid":false,"given":"Charl","family":"Ras","sequence":"additional","affiliation":[]},{"given":"Doreen","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2026.102268_br0010","series-title":"Proceedings of 37th Conference on Foundations of Computer Science","first-page":"2","article-title":"Polynomial time approximation schemes for Euclidean TSP and other geometric problems","author":"Arora","year":"1996"},{"issue":"4","key":"10.1016\/j.comgeo.2026.102268_br0020","doi-asserted-by":"crossref","first-page":"2893","DOI":"10.1007\/s10878-021-00808-z","article-title":"On the restricted k-Steiner tree problem","volume":"44","author":"Bose","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.comgeo.2026.102268_br0030","series-title":"Optimal Interconnection Trees in the Plane, vol. 29","author":"Brazil","year":"2015"},{"key":"10.1016\/j.comgeo.2026.102268_br0040","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00407-013-0127-z","article-title":"On the history of the Euclidean Steiner tree problem","volume":"68","author":"Brazil","year":"2014","journal-title":"Arch. Hist. Exact Sci."},{"issue":"1","key":"10.1016\/j.comgeo.2026.102268_br0050","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/s00453-013-9780-5","article-title":"Generalised k-Steiner tree problems in normed planes","volume":"71","author":"Brazil","year":"2015","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2026.102268_br0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.comgeo.2024.102099","article-title":"An exact algorithm for the Euclidean k-Steiner tree problem","volume":"121","author":"Brazil","year":"2024","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.comgeo.2026.102268_br0070","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/0196-6774(87)90032-0","article-title":"The 1-Steiner tree problem","volume":"8","author":"Georgakopoulos","year":"1987","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.comgeo.2026.102268_br0080","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/43.46785","article-title":"New algorithms for the rectilinear Steiner tree problem","volume":"9","author":"Ho","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"10.1016\/j.comgeo.2026.102268_br0090","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10100-016-0437-8","article-title":"Generating subtour elimination constraints for the TSP from pure integer solutions","volume":"25","author":"Pferschy","year":"2017","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"10.1016\/j.comgeo.2026.102268_br0100","series-title":"Proceedings of the Tenth Annual Symposium on Computational Geometry","first-page":"250","article-title":"On the maximum degree of minimum spanning trees","author":"Robins","year":"1994"},{"issue":"6","key":"10.1016\/j.comgeo.2026.102268_br0110","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230220604","article-title":"Degree-five Steiner points cannot reduce network costs for planar sets","volume":"22","author":"Rubinstein","year":"1992","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.comgeo.2026.102268_br0120","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10898-015-0325-0","article-title":"Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point","volume":"64","author":"Sirinanda","year":"2016","journal-title":"J. Glob. Optim."},{"issue":"2","key":"10.1016\/j.comgeo.2026.102268_br0130","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1111\/j.1475-3995.2007.00579.x","article-title":"Network modelling of underground mine layout: two case studies","volume":"14","author":"Thomas","year":"2007","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.comgeo.2026.102268_br0140","first-page":"79","article-title":"De maximis et minimis","volume":"vol. 1","author":"Torricelli","year":"1919"},{"key":"10.1016\/j.comgeo.2026.102268_br0150","series-title":"Spanning Trees in Hypergraphs with Applications to Steiner Trees","author":"Warme","year":"1998"},{"issue":"3","key":"10.1016\/j.comgeo.2026.102268_br0160","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","article-title":"An algorithm for the Steiner problem in the Euclidean plane","volume":"15","author":"Winter","year":"1985","journal-title":"Networks"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577212600026X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577212600026X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:53:37Z","timestamp":1774036417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577212600026X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":16,"alternative-id":["S092577212600026X"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2026.102268","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved exact algorithm for the Euclidean k-Steiner tree problem","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2026.102268","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102268"}}