{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:30Z","timestamp":1740123990482,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T00:00:00Z","timestamp":1593043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160100639"],"award-info":[{"award-number":["DP160100639"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10957-020-01690-1","type":"journal-article","created":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T09:02:27Z","timestamp":1593075747000},"page":"102-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane"],"prefix":"10.1007","volume":"186","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7358-5204","authenticated-orcid":false,"given":"Marcus","family":"Volz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Brazil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charl","family":"Ras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doreen","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,25]]},"reference":[{"issue":"3","key":"1690_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(96)80467-7","volume":"70","author":"D Lee","year":"1996","unstructured":"Lee, D., Yang, C.D., Wong, C.: Rectilinear paths among rectilinear obstacles. Discrete Appl. Math. 70(3), 185\u2013215 (1996)","journal-title":"Discrete Appl. Math."},{"key":"1690_CR2","unstructured":"Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: 1994 IEEE International Symposium on Circuits and Systems, 1994. ISCAS\u201994, vol.\u00a01, pp. 113\u2013116. IEEE (1994)"},{"key":"1690_CR3","unstructured":"Li, L., Young, E.F.: Obstacle-avoiding rectilinear Steiner tree construction. In: Proceedings of the 2008 IEEE\/ACM International Conference on Computer-Aided Design, pp. 523\u2013528. IEEE Press (2008)"},{"issue":"4","key":"1690_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TCAD.2008.917583","volume":"27","author":"CW Lin","year":"2008","unstructured":"Lin, C.W., Chen, S.Y., Li, C.F., Chang, Y.W., Yang, C.L.: Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(4), 643\u2013653 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"12","key":"1690_CR5","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1109\/TCAD.2008.2006098","volume":"27","author":"J Long","year":"2008","unstructured":"Long, J., Zhou, H., Memik, S.O.: EBOARST: an efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(12), 2169\u20132182 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"3","key":"1690_CR6","first-page":"45","volume":"14","author":"CH Liu","year":"2009","unstructured":"Liu, C.H., Yuan, S.Y., Kuo, S.Y., Wang, S.C.: High-performance obstacle-avoiding rectilinear Steiner tree construction. ACM Trans. Des. Autom. Electron. Syst. (TODAES) 14(3), 45 (2009)","journal-title":"ACM Trans. Des. Autom. Electron. Syst. (TODAES)"},{"key":"1690_CR7","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":"2","key":"1690_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TCAD.2010.2096571","volume":"30","author":"G Ajwani","year":"2011","unstructured":"Ajwani, G., Chu, C., Mak, W.K.: FOARS: FLUTE based obstacle-avoiding rectilinear Steiner tree construction. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(2), 194\u2013204 (2011)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"5","key":"1690_CR9","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1109\/TCAD.2010.2098930","volume":"30","author":"T Huang","year":"2011","unstructured":"Huang, T., Li, L., Young, E.F.: On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(5), 718\u2013731 (2011)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"7","key":"1690_CR10","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":"1690_CR11","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."},{"key":"1690_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13915-9","volume-title":"Optimal Interconnection Trees in the Plane","author":"M Brazil","year":"2015","unstructured":"Brazil, M., Zachariasen, M.: Optimal Interconnection Trees in the Plane. Springer, Berlin (2015)"},{"key":"1690_CR13","unstructured":"Volz, M., Brazil, M., Ras, C., Thomas, D.: Simplifying obstacles for Steiner network problems in the plane (Submitted, 2018)"},{"key":"1690_CR14","doi-asserted-by":"crossref","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: an updated library on Steiner tree problems in graphs. In: Cheng, X.Z., Du, D.-Z. (eds.) Steiner Trees in Industry, pp. 285\u2013325. Springer, Berlin (2001)","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"1690_CR15","doi-asserted-by":"crossref","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: Exact algorithms for plane Steiner tree problems: a computational study. In: Advances In: Du, D.-Z., Smith, J.M., Rubinstein, J.H. (eds.) Steiner Trees, pp. 81\u2013116. Springer, Berlin (2000)","DOI":"10.1007\/978-1-4757-3171-2_6"},{"key":"1690_CR16","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"},{"issue":"6","key":"1690_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Commun. ACM 7(6), 347\u2013348 (1964)","journal-title":"Commun. ACM"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01690-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-020-01690-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01690-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:32:56Z","timestamp":1624581176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-020-01690-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,25]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1690"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01690-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2020,6,25]]},"assertion":[{"value":"26 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}