{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:10Z","timestamp":1759638310321},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T00:00:00Z","timestamp":1193443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00453-007-9080-z","type":"journal-article","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T17:25:11Z","timestamp":1193419511000},"page":"299-311","source":"Crossref","is-referenced-by-count":16,"title":["The Swap Edges of a Multiple-Sources Routing Tree"],"prefix":"10.1007","volume":"50","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Chih-Yuan","family":"Hsiao","sequence":"additional","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,27]]},"reference":[{"key":"9080_CR1","doi-asserted-by":"crossref","unstructured":"Di Salvo, A., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. In: SIROCCO\u201904. Lecture Notes in Computer Science, vol.\u00a03104, pp.\u00a099\u2013110 (2004)","DOI":"10.1007\/978-3-540-27796-5_10"},{"issue":"6","key":"9080_CR2","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"Dixon, B., Rauch, M., Tarjan, R.E.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput. 21(6), 1184\u20131192 (1992)","journal-title":"SIAM J. Comput."},{"key":"9080_CR3","first-page":"617","volume-title":"Handbook in OR and MS","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Handbook in OR and MS, vol. 7, pp. 617\u2013672. Elsevier, Amsterdam (1995)"},{"issue":"3","key":"9080_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"G.F. Italiano","year":"1998","unstructured":"Italiano, G.F., Ramaswami, R.: Maintaining spanning trees of small diameter. Algorithmica 22(3), 275\u2013304 (1998)","journal-title":"Algorithmica"},{"issue":"5","key":"9080_CR5","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0020-0190(93)90082-K","volume":"48","author":"K. Iwano","year":"1993","unstructured":"Iwano, K., Katoh, N.: Efficient algorithms for finding the most vital edge of a minimum spanning tree. Inf. Process. Lett. 48(5), 211\u2013213 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9080_CR6","doi-asserted-by":"crossref","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)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9080_CR7","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest paths tree is good and fast. Algorithmica 35(1), 56\u201374 (2003)","journal-title":"Algorithmica"},{"key":"9080_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0196-6774(02)00205-5","volume":"44","author":"B.Y. Wu","year":"2002","unstructured":"Wu, B.Y.: A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J.\u00a0Algorithms 44, 359\u2013378 (2002)","journal-title":"J.\u00a0Algorithms"},{"key":"9080_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.dam.2003.10.002","volume":"143","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y.: Approximation algorithms for the optimal p-source communication spanning tree. Discrete Appl. Math. 143, 31\u201342 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9080_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203497289","volume-title":"Spanning Trees and Optimization Problems","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y., Chao, K.-M.: Spanning Trees and Optimization Problems. Chapman & Hall\/CRC Press, New York (2004)"},{"key":"9080_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","volume":"102","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Chao, K.-M., Tang, C.Y.: Approximation algorithms for some optimum communication spanning tree problems. Discrete Appl. Math. 102, 245\u2013266 (2000)","journal-title":"Discrete Appl. Math."},{"key":"9080_CR12","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K.-M., Ravi, R., Tang, C.Y.: A\u00a0polynomial time approximation scheme for minimum routing cost spanning trees. SIAM J. Comput. 29, 761\u2013778 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9080-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9080-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9080-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9080-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,27]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9080"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9080-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,27]]}}}