{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:49:22Z","timestamp":1756464562583},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1007\/bf02067243","type":"journal-article","created":{"date-parts":[[2005,8,14]],"date-time":"2005-08-14T14:06:39Z","timestamp":1124028399000},"page":"577-599","source":"Crossref","is-referenced-by-count":9,"title":["Steiner minimal trees for three points with one convex polygonal obstacle"],"prefix":"10.1007","volume":"33","author":[{"given":"Pawel","family":"Winter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"MacGregor Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02067243_CR1","volume-title":"A heuristic algorithm for the Steiner problem with obstacles","author":"A. Armillotta","year":"1988","unstructured":"A. Armillotta and G. Mummolo, A heuristic algorithm for the Steiner problem with obstacles, Technical Report, Dipt. di Pregettazione e Produzione Industriale, Univ. degli Studi di Bari, Italy (1988)."},{"key":"BF02067243_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)."},{"key":"BF02067243_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16(1968)1\u201329.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02067243_CR4","unstructured":"F.K. Hwang and D. Richards, Steiner tree problems, Networks (1989), to appear."},{"key":"BF02067243_CR5","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M.I. Shamos,Computational Geometry: An Introduction (Springer, 1985).","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"BF02067243_CR6","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1137\/0217057","volume":"17","author":"J. Scott Provan","year":"1988","unstructured":"J. Scott Provan, An approximation scheme for finding Steiner trees with obstacles, SIAM J. Comput. 17(1988)920\u2013934.","journal-title":"SIAM J. Comput."},{"key":"BF02067243_CR7","first-page":"15","volume":"4","author":"J. MacGregor Smith","year":"1979","unstructured":"J. MacGregor Smith and J.S. Liebman, Steiner trees, Steiner circuits, and the interference problem in building design, Eng. Design 4(1979)15\u201336.","journal-title":"Eng. Design"},{"key":"BF02067243_CR8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"J. MacGregor Smith","year":"1981","unstructured":"J. MacGregor Smith, D.T. Lee and J.S. Liebman, AnO(n logn) heuristic for the Steiner minimal tree problem on the Euclidean metric, Networks 11(1981)23\u201329.","journal-title":"Networks"},{"key":"BF02067243_CR9","unstructured":"J. MacGregor Smith, Steiner minimal trees with obstacles, Paper presented at the ORSA\/TIMS Meeting, Detroit, MI (1982)."},{"key":"BF02067243_CR10","unstructured":"J. MacGregor Smith, Generalized Steiner network problems in engineering design, in:Design Optimization, ed. J.S. Gero (Academic Press, 1985), ch. 5."},{"key":"BF02067243_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan,Data Structures and Network Algorithms (SIAM, Philadelphia, 1983)."},{"key":"BF02067243_CR12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230150305","volume":"15","author":"P. Winter","year":"1985","unstructured":"P. Winter, An algorithm for the Steiner problem in the Euclidean plane, Networks 15(1985)323\u2013345.","journal-title":"Networks"},{"key":"BF02067243_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, Steiner problem in networks: A survey, Networks 17(1987)129\u2013167.","journal-title":"Networks"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02067243.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02067243\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02067243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T09:13:30Z","timestamp":1557825210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02067243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF02067243"],"URL":"https:\/\/doi.org\/10.1007\/bf02067243","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}