{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:11Z","timestamp":1760441411751,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_26","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut"],"prefix":"10.1007","author":[{"given":"Jean-Lou","family":"De Carufel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Grimm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schirra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.endm.2016.09.029","volume":"54","author":"J C\u00e1ceres","year":"2016","unstructured":"C\u00e1ceres, J., Garijo, D., Gonz\u00e1lez, A., M\u00e1rquez, A., Puertas, M.L., Ribeiro, P.: Shortcut Sets for Plane Euclidean Networks. Electron. Notes Discrete Math. 54, 163\u2013168 (2016)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"26_CR2","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"},{"unstructured":"De Carufel, J.L., Grimm, C., Maheshwari, A., Smid, M.: Minimizing the continuous diameter when augmenting paths and cycles with shortcuts. In: SWAT 2016, pp. 27:1\u201327:14 (2016)","key":"26_CR3"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/050635675","volume":"38","author":"M Farshi","year":"2008","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the Stretch Factor of a Geometric Network by Edge Augmentation. SIAM J. Comp. 38(1), 226\u2013240 (2008)","journal-title":"SIAM J. Comp."},{"issue":"4","key":"26_CR5","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":"26_CR6","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. Discrete Appl. Math. 161(10\u201311), 1626\u20131631 (2013)","journal-title":"Discrete Appl. Math."},{"key":"26_CR7","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). doi:10.1007\/978-3-662-47672-7_55"},{"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 (2016). arXiv:1607.05547","key":"26_CR8","DOI":"10.1007\/978-3-662-47672-7_55"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research 12(3), 450\u2013459 (1964)","journal-title":"Operations Research"},{"issue":"5","key":"26_CR10","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. Operations Research Letters 11(5), 303\u2013308 (1992)","journal-title":"Operations Research Letters"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-540-92182-0_67","volume-title":"Algorithms and Computation","author":"J Luo","year":"2008","unstructured":"Luo, J., Wulff-Nilsen, C.: Computing best and worst shortcuts of graphs embedded in metric spaces. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 764\u2013775. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-92182-0_67"},{"unstructured":"Oh, E., Ahn, H.K.: A near-optimal algorithm for finding an optimal shortcut of a tree. In: ISAAC 2016, pp. 59:1\u201359:12 (2016)","key":"26_CR12"},{"issue":"3","key":"26_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. Journal of Graph Theory 11(3), 409\u2013427 (1987)","journal-title":"Journal of Graph Theory"},{"key":"26_CR14","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. Theor. Comput. Sci. 497, 55\u201367 (2013)","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-319-62127-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:17:18Z","timestamp":1709828238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","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":"St. John's","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","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"}}]}}