{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:32:55Z","timestamp":1760441575651,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_34","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"466-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y","volume":"35","author":"N Alon","year":"2000","unstructured":"Alon, N., Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M.: Decreasing the diameter of bounded degree graphs. J. Graph Theory 35, 161\u2013172 (2000)","journal-title":"J. Graph Theory"},{"key":"34_CR2","unstructured":"Bae, S., de Berg, M., Cheong, O., Gudmundsson, J., Levcopoulos, C.: Shortcuts for the circle. In: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC), pp. 9:1\u20139:13 (2017)"},{"key":"34_CR3","unstructured":"Bil\u00f2, D.: Almost optimal algorithms for diameter-optimally augmenting trees. In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC), pp. 40:1\u201340:13 (2018)"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2011.05.014","volume":"417","author":"D Bil\u00f2","year":"2012","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Improved approximability and non-approximability results for graph diameter decreasing problems. Theor. Comput. Sci. 417, 12\u201322 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR5","unstructured":"Carufel, J.L.D., Grimm, C., Maheshwari, A., Smid, M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: Proceedings of the 15th Scandinavian Workshop on Algorithm Theory (SWAT), pp. 27:1\u201327:14 (2016)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Carufel, J.L.D., Grimm, C., Schirra, S., Smid, M.: Minimizing the continuous diameter when augmenting a tree with a shortcut. In: Proceedings of the 15th Algorithms and Data Structures Symposium (WADS), pp. 301\u2013312 (2017)","DOI":"10.1007\/978-3-319-62127-2_26"},{"key":"34_CR7","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"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.dam.2013.01.016","volume":"161","author":"Y Gao","year":"2013","unstructured":"Gao, Y., Hare, D., Nastos, J.: The parametric complexity of graph diameter augmentation. Discrete Appl. Math. 161, 1626\u20131631 (2013)","journal-title":"Discrete Appl. Math."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-662-47672-7_55","volume-title":"Automata, Languages, and Programming","author":"Ulrike Gro\u00dfe","year":"2015","unstructured":"Gro\u00dfe, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F.: Fast algorithms for diameter-optimally augmenting paths. In: Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 678\u2013688 (2015)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Gro\u00dfe, U., Gudmundsson, J., Knauer, C., Smid, M., Stehn, F.: Fast algorithms for diameter-optimally augmenting paths and trees. arXiv:1607.05547 (2016)","DOI":"10.1007\/978-3-662-47672-7_55"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1002\/jgt.21719","volume":"74","author":"T Ishii","year":"2013","unstructured":"Ishii, T.: Augmenting outerplanar graphs to meet diameter requirements. J. Graph Theory 74, 392\u2013416 (2013)","journal-title":"J. Graph Theory"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(92)90007-P","volume":"11","author":"CL Li","year":"1992","unstructured":"Li, C.L., McCormick, S., Simchi-Levi, D.: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11, 303\u2013308 (1992)","journal-title":"Oper. Res. Lett."},{"key":"34_CR13","unstructured":"Oh, E., Ahn, H.K.: A near-optimal algorithm for finding an optimal shortcut of a tree. In: Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC), pp. 59:1\u201359:12 (2016)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/jgt.3190110315","volume":"11","author":"A Schoone","year":"1997","unstructured":"Schoone, A., Bodlaender, H., Leeuwen, J.V.: Diameter increase caused by edge deletion. J. Graph Theory 11, 409\u2013427 (1997)","journal-title":"J. Graph Theory"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comgeo.2018.06.004","volume":"75","author":"H Wang","year":"2018","unstructured":"Wang, H.: An improved algorithm for diameter-optimally augmenting paths in a metric space. Comput. Geometry Theory Appl. 75, 11\u201321 (2018)","journal-title":"Comput. Geometry Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:55:20Z","timestamp":1710266120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}