{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:32Z","timestamp":1740122432360,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T00:00:00Z","timestamp":1635465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10898-021-01101-3","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T02:02:32Z","timestamp":1635472952000},"page":"137-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An exact algorithm for constructing minimum Euclidean skeletons of polygons"],"prefix":"10.1007","volume":"83","author":[{"given":"Nicolau","family":"Andr\u00e9s-Thi\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Brazil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9986-2767","authenticated-orcid":false,"given":"Charl","family":"Ras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doreen","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Volz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,29]]},"reference":[{"issue":"6","key":"1101_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/rob.20014","volume":"21","author":"E Masehian","year":"2004","unstructured":"Masehian, E., Amin-Naseri, M.: A Voronoi diagram-visibility graph-potential field compound algorithm for robot path planning. J. Robot. Syst. 21(6), 275\u2013300 (2004)","journal-title":"J. Robot. Syst."},{"key":"1101_CR2","doi-asserted-by":"crossref","unstructured":"Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proceedings of IEEE International Symposium on Circuits and Systems-ISCAS\u201994, vol.\u00a01, pp. 113\u2013116. IEEE (1994)","DOI":"10.1109\/ISCAS.1994.408768"},{"issue":"7","key":"1101_CR3","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1109\/TCAD.2012.2185050","volume":"31","author":"CH Liu","year":"2012","unstructured":"Liu, C.H., Kuo, S.Y., Lee, D., Lin, C.S., Weng, J.H., Yuan, S.Y.: Obstacle-avoiding rectilinear Steiner tree construction: a Steiner-point-based algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 31(7), 1050\u20131060 (2012)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"6","key":"1101_CR4","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1109\/TCAD.2013.2238291","volume":"32","author":"T Huang","year":"2013","unstructured":"Huang, T., Young, E.F.: ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 882\u2013893 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"1101_CR5","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.comgeo.2009.01.011","volume":"43","author":"M M\u00fcller-Hannemann","year":"2010","unstructured":"M\u00fcller-Hannemann, M., Tazari, S.: A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43(4), 395\u2013409 (2010)","journal-title":"Comput. Geom."},{"key":"1101_CR6","doi-asserted-by":"crossref","unstructured":"Huang, T., Young, E.F.: Obstacle-avoiding rectilinear Steiner minimum tree construction: an optimal approach. In: Proceedings of the International Conference on Computer-Aided Design, pp. 610\u2013613. IEEE Press (2010)","DOI":"10.1109\/ICCAD.2010.5654220"},{"issue":"5","key":"1101_CR7","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1137\/0217057","volume":"17","author":"JS Provan","year":"1988","unstructured":"Provan, J.S.: An approximation scheme for finding Steiner trees with obstacles. SIAM J. Comput. 17(5), 920\u2013934 (1988)","journal-title":"SIAM J. Comput."},{"key":"1101_CR8","first-page":"286","volume-title":"Obstacle-Avoiding Euclidean Steiner trees in the Plane: An Exact Algorithm","author":"M Zachariasen","year":"1999","unstructured":"Zachariasen, M., Winter, P.: Obstacle-Avoiding Euclidean Steiner trees in the Plane: An Exact Algorithm, pp. 286\u2013299. Springer, Berlin (1999)"},{"key":"1101_CR9","doi-asserted-by":"crossref","unstructured":"Volz, M., Brazil, M., Ras, C., Thomas, D.: Computing skeletons for rectilinearly-convex obstacles in the rectilinear plane. arXiv:2004.04365 (2020)","DOI":"10.1007\/s10957-020-01690-1"},{"key":"1101_CR10","unstructured":"Provan, J.S., Brazil, M., Thomas, D., Weng, J.F.: Minimum opaque covers for polygonal regions. arXiv:1210.8139 (2012)"},{"key":"1101_CR11","doi-asserted-by":"crossref","unstructured":"Hakimi, S.L.: Steiner\u2019s problem in graphs and its implications. Networks 1, 113\u2013133 (1971)","DOI":"10.1002\/net.3230010203"},{"issue":"5","key":"1101_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0925-7721(95)00031-3","volume":"6","author":"C Zhu","year":"1996","unstructured":"Zhu, C., Sundaram, G., Snoeyink, J., Mitchell, J.S.: Generating random polygons with given vertices. Comput. Geom. 6(5), 277\u2013290 (1996)","journal-title":"Comput. Geom."},{"key":"1101_CR13","unstructured":"Lafayette, L., Sauter, G., Vu, L., Meade, B.: Spartan performance and flexibility: an HPC-cloud chimera. OpenStack Summit, Barcelona 27 (2016)"},{"issue":"2","key":"1101_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-016-0111-0","volume":"9","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Leitner, M., Ljubi\u0107, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203\u2013229 (2017)","journal-title":"Math. Program. Comput."},{"key":"1101_CR15","unstructured":"Cplex, I.I.: V12.1: User\u2019s manual for CPLEX. Int. Bus. Mach. Corp. 46(53), 157 (2009)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01101-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01101-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01101-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:27:17Z","timestamp":1726014437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01101-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,29]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1101"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01101-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,10,29]]},"assertion":[{"value":"18 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}