{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:02:06Z","timestamp":1725562926850},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_14","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T16:17:45Z","timestamp":1281716265000},"page":"138-149","source":"Crossref","is-referenced-by-count":2,"title":["Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BF01459088","volume":"99","author":"W. Ackermann","year":"1928","unstructured":"Ackermann, W.: Zum Hilbertschen Aufbau der reellen Zahlen. Mathematical Annals\u00a099, 118\u2013133 (1928)","journal-title":"Mathematical Annals"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-92182-0_63","volume-title":"Algorithms and Computation","author":"S. Das","year":"2008","unstructured":"Das, S., Gfeller, B., Widmayer, P.: Computing best swaps in optimal tree spanners. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 716\u2013727. Springer, Heidelberg (2008)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2007.03.046","volume":"383","author":"A. Salvo Di","year":"2007","unstructured":"Di Salvo, A., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. Theoretical Computer Science\u00a0383(1), 23\u201333 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1093\/ietisy\/e89-d.2.700","volume":"89-D","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Mesa Enriques, A., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: computing the optimal swap edges distributively. IEICE Transactions\u00a089-D(2), 700\u2013708 (2006)","journal-title":"IEICE Transactions"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-540-87744-8_38","volume-title":"Algorithms - ESA 2008","author":"B. Gfeller","year":"2008","unstructured":"Gfeller, B.: Faster swap edge computation in minimum diameter spanning trees. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 454\u2013465. Springer, Heidelberg (2008)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-75142-7_22","volume-title":"Distributed Computing","author":"B. Gfeller","year":"2007","unstructured":"Gfeller, B., Santoro, N., Widmayer, P.: A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 268\u2013282. Springer, Heidelberg (2007)"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"14_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in O(n logn) time. Information Processing Letters\u00a033(4), 169\u2013174 (1989)","journal-title":"Information Processing Letters"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Rinnooy Kan, A.H.G.: The complexity of the network design problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"issue":"5","key":"14_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.7155\/jgaa.00039","volume":"5","author":"E. Nardelli","year":"2001","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. J. Graph Algorithms and Applications\u00a05(5), 39\u201357 (2001)","journal-title":"J. Graph Algorithms and Applications"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","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\u00a035(1), 56\u201374 (2003)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1706591.1706597","volume":"57","author":"G. Nivasch","year":"2010","unstructured":"Nivasch, G.: Improved bounds and new techniques for Davenport\u2013Schinzel sequences and their generalizations. J. ACM\u00a057(3), 1\u201344 (2010)","journal-title":"J. ACM"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/11602613_96","volume-title":"Algorithms and Computation","author":"S. Pettie","year":"2005","unstructured":"Pettie, S.: Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 964\u2013973. Springer, Heidelberg (2005)"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1137\/0601008","volume":"1","author":"R. Wong","year":"1980","unstructured":"Wong, R.: Worst-case analysis of network design problem heuristics. SIAM J. Algebric Discrete Methods\u00a01, 51\u201363 (1980)","journal-title":"SIAM J. Algebric Discrete Methods"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-007-9080-z","volume":"50","author":"B.Y. Wu","year":"2008","unstructured":"Wu, B.Y., Hsiao, C.-Y., Chao, K.-M.: The swap edges of a multiple-sources routing tree. Algorithmica\u00a050(3), 299\u2013311 (2008)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","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 polynomial-time approximation scheme for minimum routing cost spanning trees. SIAM J. Computing\u00a029(3), 761\u2013778 (1999)","journal-title":"SIAM J. Computing"},{"key":"14_CR17","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0102, 245\u2013266 (2000)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:01:33Z","timestamp":1606168893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}