{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:27:55Z","timestamp":1774333675508,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_28","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:05Z","timestamp":1770977225000},"page":"418-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shortcutting the\u00a0Diameter of\u00a0a\u00a0Polygon"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-6110-8035","authenticated-orcid":false,"given":"Taekang","family":"Eom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6588-4431","authenticated-orcid":false,"given":"Taehoon","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minju","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"01","key":"28_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1142\/S0129054109006425","volume":"20","author":"HK Ahn","year":"2009","unstructured":"Ahn, H.K., et al.: Constructing optimal highways. Int. J. Found. Comput. Sci. 20(01), 3\u201323 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"06","key":"28_CR2","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1142\/S0218195905001889","volume":"15","author":"AM Bhosle","year":"2005","unstructured":"Bhosle, A.M., Gonzalez, T.F.: Exact and approximation algorithms for finding an optimal bridge connecting two simple polygons. Int. J. Comput. Geometry Appl. 15(06), 609\u2013630 (2005)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"28_CR3","first-page":"192","volume":"334","author":"J C\u00e1ceres","year":"2018","unstructured":"C\u00e1ceres, J., Garijo, D., Gonz\u00e1lez, A., M\u00e1rquez, A., Puertas, M.L., Ribeiro, P.: Shortcut sets for the locus of plane Euclidean networks. Appl. Math. Comput. 334, 192\u2013205 (2018)","journal-title":"Appl. Math. Comput."},{"key":"28_CR4","unstructured":"Cardinal, J., Langerman, S.: Min-max-min geometric facility location problems. In: Proceedings of the 22nd European Workshop on Computational Geometry (EWCG 2006), pp. 149\u2013152 (2006)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Disc. Comput. Geometry 6(3), 485\u2013524 (1991). https:\/\/doi.org\/10.1007\/BF02574703","journal-title":"Disc. Comput. Geometry"},{"key":"28_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101631","volume":"89","author":"JL de Carufel","year":"2020","unstructured":"de Carufel, J.L., Grimm, C., Maheshwari, A., Schirra, S., Smid, M.: Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89, 101631 (2020)","journal-title":"Comput. Geom."},{"key":"28_CR7","unstructured":"Drezner, Z.: Facility location: a survey of applications and methods. Springer Series in Operations Research and Financial Engineering, Springer-Verlag (1996)"},{"key":"28_CR8","unstructured":"Drezner, Z., Hamacher, H.W.: Facility location: applications and theory. Springer-Verlag (2004)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s00453-014-9886-4","volume":"72","author":"F Frati","year":"2015","unstructured":"Frati, F., Gaspers, S., Gudmundsson, J., Mathieson, L.: Augmenting graphs to minimize the diameter. Algorithmica 72, 995\u20131010 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2019.05.018","volume":"279","author":"D Garijo","year":"2019","unstructured":"Garijo, D., M\u00e1rquez, A., Rodr\u00edguez, N., Silveira, R.I.: Computing optimal shortcuts for networks. Eur. J. Oper. Res. 279(1), 26\u201337 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-662-47672-7_55","volume-title":"Automata, Languages, and Programming","author":"U Gro\u00dfe","year":"2015","unstructured":"Gro\u00dfe, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F.: Fast algorithms for diameter-optimally augmenting paths. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 678\u2013688. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_55"},{"key":"28_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2023.102018","volume":"114","author":"J Gudmundsson","year":"2023","unstructured":"Gudmundsson, J., Sha, Y.: Algorithms for radius-optimally augmenting trees in a metric space. Comput. Geom. 114, 102018 (2023)","journal-title":"Comput. Geom."},{"key":"28_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2023.101996","volume":"113","author":"J Gudmundsson","year":"2023","unstructured":"Gudmundsson, J., Sha, Y.: Augmenting graphs to minimize the radius. Comput. Geom. 113, 101996 (2023)","journal-title":"Comput. Geom."},{"key":"28_CR14","unstructured":"Robert, J.M., Toussaint, G.T.: Computational geometry and facility location. Technical Report, McGill University. School Comput. Sci. (1990)"},{"issue":"03","key":"28_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218195902000852","volume":"12","author":"X Tan","year":"2002","unstructured":"Tan, X.: Finding an optimal bridge between two polygons. Int. J. Comput. Geometry Appl. 12(03), 249\u2013261 (2002)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"5","key":"28_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(00)00229-5","volume":"79","author":"DP Wang","year":"2001","unstructured":"Wang, D.P.: An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons. Inf. Process. Lett. 79(5), 229\u2013236 (2001)","journal-title":"Inf. Process. Lett."},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2012.03.021","volume":"497","author":"B Yang","year":"2013","unstructured":"Yang, B.: Euclidean chains and their shortcuts. Theoret. Comput. Sci. 497, 55\u201367 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:07:38Z","timestamp":1774325258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}