{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:50:58Z","timestamp":1761893458666},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00256-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"55-72","source":"Crossref","is-referenced-by-count":14,"title":["Short trees in polygons"],"prefix":"10.1016","volume":"118","author":[{"given":"Pawel","family":"Winter","sequence":"first","affiliation":[]},{"given":"Martin","family":"Zachariasen","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00256-6_BIB1","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(92)90214-T","article-title":"A heuristic for the Euclidean and rectilinear Steiner tree problem","volume":"58","author":"Beasley","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB2","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","article-title":"An O(nlog n) heuristic for the Steiner minimal tree problem on the Euclidean metric","volume":"11","author":"MacGregor Smith","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB4","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, S. N\u00e4her, LEDA \u2014 a platform for combinatorial and geometric computing, Max Planck Institute for Computer Science, http:\/\/www.mpi-sb.mpg.de\/LEDA\/leda.html (1996).","DOI":"10.1007\/3-540-63165-8_161"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/PL00009199","article-title":"A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains","volume":"20","author":"Papadopoulou","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB6","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1137\/0217057","article-title":"An approximation scheme for finding Steiner trees with obstacles","volume":"17","author":"Provan","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB7","first-page":"9","article-title":"Computing geodesic properties inside a simple polygon","volume":"3","author":"Toussaint","year":"1989","journal-title":"Rev. D'Intell. Artif."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB8","doi-asserted-by":"crossref","unstructured":"D.M. Warme, Spanning trees in hypergraphs with application to Steiner trees, Ph.D. Thesis, Univ. of Virginia, 1998.","DOI":"10.18130\/V3ZG4B"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB9","series-title":"Advances in Steiner Trees","first-page":"81","article-title":"Exact algorithms for plane Steiner tree problems: a computational study","author":"Warme","year":"2000"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0166-218X(93)90092-3","article-title":"Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs","volume":"47","author":"Winter","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB11","unstructured":"P. Winter, Euclidean Steiner minimum trees for 3 terminals in a simple polygon, Proceedings of the Seventh Canadian Conference on Computational Geometry, Univ. Laval, Quebec, Canada, 1995, pp. 247\u2013255."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB12","unstructured":"P. Winter, Steiner minimum trees in simple polygons, DIMACS Technical Report 95-43, 1995."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB13","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(99)00131-9","article-title":"Local search for the Steiner tree problem in the Euclidean plane","volume":"119","author":"Zachariasen","year":"1999","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00256-6_BIB14","series-title":"Algorithm Engineering and Experimentation","first-page":"282","article-title":"Obstacle-avoiding Euclidean Steiner trees in the plane: an exact algorithm","volume":"Vol. 1619","author":"Zachariasen","year":"1999"},{"key":"10.1016\/S0166-218X(01)00256-6_BIB15","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/PL00009287","article-title":"Concatenation-based greedy heuristics for the Euclidean Steiner tree problem","volume":"25","author":"Zachariasen","year":"1999","journal-title":"Algorithmica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002566?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002566?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:10:40Z","timestamp":1578442240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002566"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002566"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00256-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}