{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:03Z","timestamp":1725744903519},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_14","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"157-168","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Computation of All the Best Swap Edges of a Shortest Paths 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":"138","DOI":"10.1007\/978-3-642-15155-2_14","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Finding best swap edges minimizing the routing cost of a spanning tree. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 138\u2013149. Springer, Heidelberg (2010)"},{"key":"14_CR3","unstructured":"Brodal, G.S., Jacob, R.: Dynamic planar convex hull. In: Proc. of the 43rd Symp. on Foundations of Computer Science (FOCS 2002), pp. 617\u2013626. IEEE Comp. Soc. (2002)"},{"issue":"1","key":"14_CR4","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. Theor. Comp. Science\u00a0383(1), 23\u201333 (2007)","journal-title":"Theor. Comp. Science"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00453-007-9016-7","volume":"49","author":"L. Gual\u00e0","year":"2007","unstructured":"Gual\u00e0, L., Proietti, G.: Exact and approximate truthful mechanisms for the shortest-paths tree problem. Algorithmica\u00a049(3), 171\u2013191 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"14_CR6","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":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00453-010-9448-3","volume":"62","author":"B. Gfeller","year":"2012","unstructured":"Gfeller, B.: Faster swap edge computation in minimum diameter spanning trees. Algorithmica\u00a062(1-2), 169\u2013191 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","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\u00a022(3), 275\u2013304 (1998)","journal-title":"Algorithmica"},{"key":"14_CR10","unstructured":"Ito, H., Iwama, K., Okabe, Y., Yoshihiro, T.: Polynomial-time computable backup tables for shortest-path routing. In: Proc. of the 10th Int. Coll. on Structural Information and Communication Complexity (SIROCCO 2003). Proceedings in Informatics, Carleton Scientific, vol.\u00a017, pp. 163\u2013177 (2003)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48686-0_14","volume-title":"Computing and Combinatorics","author":"E. Nardelli","year":"1999","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: How to swap a failing edge of a single source shortest paths tree. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 144\u2013153. Springer, Heidelberg (1999)"},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","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. Journal of Graph Algorithms and Applications\u00a05(5), 39\u201357 (2001)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00453-003-1024-7","volume":"36","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\u00a036(4), 361\u2013374 (2003)","journal-title":"Algorithmica"},{"key":"14_CR14","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_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44691-5_18","volume-title":"Algorithm Engineering","author":"G. Proietti","year":"2001","unstructured":"Proietti, G.: Dynamic maintenance versus swapping: an experimental study on shortest paths trees. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 207\u2013217. Springer, Heidelberg (2001)"},{"issue":"3","key":"14_CR16","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":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R.E. Tarjan","year":"1982","unstructured":"Tarjan, R.E.: Sensitivity analysis of minimum spanning trees and shortest path trees. Inf. Process. Lett.\u00a014(1), 30\u201333 (1982)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:50:37Z","timestamp":1558011037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}