{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:15:10Z","timestamp":1743084910456,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_12","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Diameter-Reducing Shortcuts in\u00a0Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3169-4300","authenticated-orcid":false,"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6976-5579","authenticated-orcid":false,"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8848-7006","authenticated-orcid":false,"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4432-6099","authenticated-orcid":false,"given":"Luca Pep\u00e8","family":"Sciarria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Adriaens, F., Gionis, A.: Diameter minimization by shortcutting with degree constraints. CoRR abs\/2209.00370 (2022). https:\/\/doi.org\/10.48550\/arXiv.2209.00370. Accepted at the IEEE ICDM 2022 conference","DOI":"10.48550\/arXiv.2209.00370"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2022.07.028","volume":"931","author":"D Bil\u00f2","year":"2022","unstructured":"Bil\u00f2, D.: Almost optimal algorithms for diameter-optimally augmenting trees. Theor. Comput. Sci. 931, 31\u201348 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.07.028","journal-title":"Theor. Comput. Sci."},{"key":"12_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. Theor. Comput. Sci. 417, 12\u201322 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"101631","DOI":"10.1016\/j.comgeo.2020.101631","volume":"89","author":"JD Carufel","year":"2020","unstructured":"Carufel, J.D., Grimm, C., Maheshwari, A., Schirra, S., Smid, M.H.M.: Minimizing the continuous diameter when augmenting a geometric tree with a shortcut. Comput. Geom. 89, 101631 (2020). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101631","journal-title":"Comput. Geom."},{"key":"12_CR5","unstructured":"Carufel, J.D., Grimm, C., Maheshwari, A., Smid, M.H.M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: Pagh, R. (ed.) 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016. LIPIcs, vol. 53, pp. 27:1\u201327:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00453-001-0113-8","volume":"33","author":"V Chepoi","year":"2002","unstructured":"Chepoi, V., Vax\u00e8s, Y.: Augmenting trees to meet biconnectivity and diameter constraints. Algorithmica 33(2), 243\u2013262 (2002)","journal-title":"Algorithmica"},{"key":"12_CR7","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":"12_CR8","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)","journal-title":"Algorithmica"},{"issue":"10\u201311","key":"12_CR9","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":"12_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90224-5","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S0129054119500060","volume":"30","author":"U Gro\u00dfe","year":"2019","unstructured":"Gro\u00dfe, U., Knauer, C., Stehn, F., Gudmundsson, J., Smid, M.H.M.: Fast algorithms for diameter-optimally augmenting paths and trees. Int. J. Found. Comput. Sci. 30(2), 293\u2013313 (2019). https:\/\/doi.org\/10.1142\/S0129054119500060","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-030-83508-8_33","volume-title":"Algorithms and Data Structures","author":"J Gudmundsson","year":"2021","unstructured":"Gudmundsson, J., Sha, Y.: Algorithms for radius-optimally augmenting trees in a metric space. In: Lubiw, A., Salavatipour, M. (eds.) WADS 2021. LNCS, vol. 12808, pp. 457\u2013470. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_33"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Gudmundsson, J., Sha, Y., Yao, F.: Augmenting graphs to minimize the radius. In: Ahn, H., Sadakane, K. (eds.) 32nd International Symposium on Algorithms and Computation, ISAAC 2021, 6\u20138 December 2021, Fukuoka, Japan. LIPIcs, vol. 212, pp. 45:1\u201345:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2021.45","DOI":"10.4230\/LIPIcs.ISAAC.2021.45"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Harel, D., Tarjan., R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984). https:\/\/doi.org\/10.1137\/0213024","DOI":"10.1137\/0213024"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Johnson, C., Wang, H.: A linear-time algorithm for radius-optimally augmenting paths in a metric space. Comput. Geom. 96, 101759 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101759","DOI":"10.1016\/j.comgeo.2021.101759"},{"issue":"5","key":"12_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(92)90007-P","volume":"11","author":"C Li","year":"1992","unstructured":"Li, C., McCormick, S.T., Simchi-Levi, D.: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11(5), 303\u2013308 (1992). https:\/\/doi.org\/10.1016\/0167-6377(92)90007-P","journal-title":"Oper. Res. Lett."},{"key":"12_CR17","unstructured":"Oh, E., Ahn, H.: A near-optimal algorithm for finding an optimal shortcut of a tree. In: Hong, S. (ed.) 27th International Symposium on Algorithms and Computation, ISAAC 2016, 12\u201314 December 2016, Sydney, Australia. LIPIcs, vol. 64, pp. 59:1\u201359:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"12_CR18","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":"12_CR19","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). https:\/\/doi.org\/10.1016\/j.comgeo.2018.06.004","journal-title":"Comput. Geom."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.tcs.2021.09.014","volume":"890","author":"H Wang","year":"2021","unstructured":"Wang, H., Zhao, Y.: Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. Theor. Comput. Sci. 890, 192\u2013209 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.09.014","journal-title":"Theor. Comput. Sci."}],"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-031-38906-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:06:07Z","timestamp":1690473967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","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":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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":"92","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":"51% - 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":"10","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)"}}]}}