{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:22Z","timestamp":1740109282368,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014810","name":"Fondazione di Sardegna","doi-asserted-by":"crossref","award":["D.R. UniSassari 2797\/2018"],"award-info":[{"award-number":["D.R. UniSassari 2797\/2018"]}],"id":[{"id":"10.13039\/100014810","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00453-019-00549-w","type":"journal-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T19:47:51Z","timestamp":1548445671000},"page":"279-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner"],"prefix":"10.1007","volume":"82","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Feliciano","family":"Colella","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1009-5552","authenticated-orcid":false,"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,25]]},"reference":[{"key":"549_CR1","unstructured":"Abraham, I., Bartal, Y., Neiman, O.: Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 502\u2013511 (2007)"},{"issue":"2","key":"549_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2), 243\u2013264 (2005). https:\/\/doi.org\/10.1145\/1103963.1103966","journal-title":"ACM Trans. Algorithms"},{"key":"549_CR3","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Colella, F., Gual\u00e0, L., Leucci, S., Proietti, G.: A faster computation of all the best swap edges of a tree spanner. In: Proceedings of the International Colloquium on Structural Information and Communication Complexity, pp. 239\u2013253 (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_17","DOI":"10.1007\/978-3-319-25258-2_17"},{"key":"549_CR4","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., Colella, F., Gual\u00e0, L., Leucci, S., Proietti, G.: Effective edge-fault-tolerant single-source spanners via best (or good) swap edges. In: Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity, pp. 303\u2013317 (2017). https:\/\/doi.org\/10.1007\/978-3-319-72050-0_18","DOI":"10.1007\/978-3-319-72050-0_18"},{"issue":"2","key":"549_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00453-012-9674-y","volume":"68","author":"D Bil\u00f2","year":"2014","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Finding best swap edges minimizing the routing cost of a spanning tree. Algorithmica 68(2), 337\u2013357 (2014). https:\/\/doi.org\/10.1007\/s00453-012-9674-y","journal-title":"Algorithmica"},{"issue":"3","key":"549_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00453-014-9912-6","volume":"73","author":"D Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: A faster computation of all the best swap edges of a shortest paths tree. Algorithmica 73(3), 547\u2013570 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9912-6","journal-title":"Algorithmica"},{"issue":"1","key":"549_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/jagm.1998.0962","volume":"30","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Chepoi, V., Dragan, F.F.: Distance approximating trees for chordal and dually chordal graphs. J. Algorithms 30(1), 166\u2013184 (1999). https:\/\/doi.org\/10.1006\/jagm.1998.0962","journal-title":"J. Algorithms"},{"key":"549_CR8","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 617\u2013626. IEEE (2002)"},{"issue":"3","key":"549_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discret. Math. 8(3), 359\u2013387 (1995). https:\/\/doi.org\/10.1137\/S0895480192237403","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"549_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.7155\/jgaa.00208","volume":"14","author":"S Das","year":"2010","unstructured":"Das, S., Gfeller, B., Widmayer, P.: Computing all best swaps for minimum-stretch tree spanners. J. Gr. Algorithms Appl. 14(2), 287\u2013306 (2010)","journal-title":"J. Gr. Algorithms Appl."},{"issue":"5","key":"549_CR11","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Y Emek","year":"2008","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM J. Comput. 38(5), 1761\u20131781 (2008). https:\/\/doi.org\/10.1137\/060666202","journal-title":"SIAM J. Comput."},{"key":"549_CR12","doi-asserted-by":"publisher","unstructured":"Gabow, H.N.: A scaling algorithm for weighted matching on general graphs. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 90\u2013100 (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.3","DOI":"10.1109\/SFCS.1985.3"},{"issue":"3","key":"549_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"GF Italiano","year":"1998","unstructured":"Italiano, G.F., Ramaswami, R.: Maintaining spanning trees of small diameter. Algorithmica 22(3), 275\u2013304 (1998). https:\/\/doi.org\/10.1007\/PL00009225","journal-title":"Algorithmica"},{"key":"549_CR14","unstructured":"Ito, H., Iwama, K., Okabe, Y., Yoshihiro, T.: Polynomial-time computable backup tables for shortest-path routing. In: Proceedings of the 10th International Colloquium Structural Information and Communication Complexity, pp. 163\u2013177 (2003)"},{"issue":"185","key":"549_CR15","first-page":"81","volume":"70","author":"C Jordan","year":"1869","unstructured":"Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math 70(185), 81 (1869)","journal-title":"J. Reine Angew. Math"},{"issue":"5","key":"549_CR16","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.dam.2007.07.001","volume":"156","author":"C Liebchen","year":"2008","unstructured":"Liebchen, C., W\u00fcnsch, G.: The zoo of tree spanner problems. Discret. Appl. Math. 156(5), 569\u2013587 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.07.001","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"549_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(00)00175-7","volume":"79","author":"E Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79(2), 81\u201385 (2001). https:\/\/doi.org\/10.1016\/S0020-0190(00)00175-7","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"549_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-004-1099-9","volume":"40","author":"E Nardelli","year":"2004","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Nearly linear time minimum spanning tree maintenance for transient node failures. Algorithmica 40(2), 119\u2013132 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1099-9","journal-title":"Algorithmica"},{"key":"549_CR19","doi-asserted-by":"publisher","unstructured":"Pettie, S.: Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In: Proceedings of the 16th International Symposium on Algorithms and Computation, pp. 964\u2013973 (2005). https:\/\/doi.org\/10.1007\/11602613_96","DOI":"10.1007\/11602613_96"},{"key":"549_CR20","doi-asserted-by":"publisher","unstructured":"Proietti, G.: Dynamic maintenance versus swapping: an experimental study on shortest paths trees. In: Proceedings of the 4th International Workshop on Algorithm Engineering, pp. 207\u2013217 (2000). https:\/\/doi.org\/10.1007\/3-540-44691-5_18","DOI":"10.1007\/3-540-44691-5_18"},{"issue":"1","key":"549_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2007.03.046","volume":"383","author":"AD Salvo","year":"2007","unstructured":"Salvo, A.D., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theor. Comput. Sci. 383(1), 23\u201333 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.03.046","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"549_CR22","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"RE Tarjan","year":"1982","unstructured":"Tarjan, R.E.: Sensitivity analysis of minimum spanning trees and shortest path trees. Inf. Process. Lett. 14(1), 30\u201333 (1982). https:\/\/doi.org\/10.1016\/0020-0190(82)90137-5","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"549_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-007-9080-z","volume":"50","author":"BY Wu","year":"2008","unstructured":"Wu, B.Y., Hsiao, C., Chao, K.: The swap edges of a multiple-sources routing tree. Algorithmica 50(3), 299\u2013311 (2008). https:\/\/doi.org\/10.1007\/s00453-007-9080-z","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-019-00549-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00549-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T13:10:07Z","timestamp":1641561007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-019-00549-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00549-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,1,25]]},"assertion":[{"value":"1 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}