{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:35Z","timestamp":1759639055869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_33","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"457-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Radius-Optimally Augmenting Trees in a Metric Space"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Sha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"key":"33_CR2","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":"33_CR3","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. Theoret. Comput. Sci. 417, 12\u201322 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR4","unstructured":"Carufel, J.D., Grimm, C., Maheshwari, A., Smid, M.H.M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 27:1\u201327:14 (2016)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-62127-2_26","volume-title":"Algorithms and Data Structures","author":"J-L De Carufel","year":"2017","unstructured":"De Carufel, J.-L., Grimm, C., Schirra, S., Smid, M.: Minimizing the continuous diameter when augmenting a tree with a shortcut. In: WADS 2017. LNCS, vol. 10389, pp. 301\u2013312. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_26"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-13731-0_39","volume-title":"Algorithm Theory - SWAT 2010","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Zadimoghaddam, M.: Minimizing the diameter of a network using shortcut edges. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 420\u2013431. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13731-0_39"},{"issue":"4","key":"33_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(4), 995\u20131010 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9886-4","journal-title":"Algorithmica"},{"issue":"10\u201311","key":"33_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.R., Nastos, J.: The parametric complexity of graph diameter augmentation. Discret. Appl. Math. 161(10\u201311), 1626\u20131631 (2013)","journal-title":"Discret. Appl. Math."},{"key":"33_CR9","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":"33_CR10","unstructured":"Gudmundsson, J., Sha, Y.: Augmenting graphs to minimize the radius. Manuscript (2021)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Johnson, C., Wang, H.: A linear-time algorithm for radius-optimally augmenting paths in a metric space. In: Proceedings of the 15th International Symposium on Algorithms and Data Structures, pp. 466\u2013480 (2019)","DOI":"10.1007\/978-3-030-24766-9_34"},{"key":"33_CR12","unstructured":"Oh, E., Ahn, H.: 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)"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/jgt.3190110315","volume":"11","author":"AA Schoone","year":"1987","unstructured":"Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter increase caused by edge deletion. J. Graph Theory 11(3), 409\u2013427 (1987)","journal-title":"J. Graph Theory"},{"key":"33_CR14","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. Geom. 75, 11\u201321 (2018)","journal-title":"Comput. Geom."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhao, Y.: Algorithms for Diameters of Unicycle Graphs and Diameter-optimally Augmenting Trees (2020)","DOI":"10.1007\/978-3-030-68211-8_3"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Wang, H., Zhao, Y.: A linear-time algorithm for discrete radius optimally augmenting paths in a metric space (2020)","DOI":"10.1142\/S0218195920500089"}],"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-83508-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:28:43Z","timestamp":1645183723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}