{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:47Z","timestamp":1725564827165},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_10","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T17:47:42Z","timestamp":1283708862000},"page":"99-110","source":"Crossref","is-referenced-by-count":4,"title":["Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor"],"prefix":"10.1007","author":[{"given":"Aleksej","family":"Di Salvo","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Shariri, M.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1995)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-45995-2_44","volume-title":"LATIN 2002: Theoretical Informatics","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 508\u2013515. Springer, Heidelberg (2002)"},{"issue":"2","key":"10_CR3","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"},{"key":"10_CR4","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 log n) time. Information Processing Letters\u00a033, 169\u2013174 (1989)","journal-title":"Information Processing Letters"},{"issue":"4","key":"10_CR5","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":"10_CR6","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)"},{"key":"10_CR7","unstructured":"Proietti, G.: Computing a single swap edge in a shortest paths tree by minimizing the average distance from the root (manuscript) available at \n                  \n                    http:\/\/www.di.univaq.it\/~proietti\/paper.ps"},{"key":"10_CR8","unstructured":"Ito, H., Iwama, K., Okabe, Y., Yoshihiro, T.: Polynomial-time computable backup tables for shortest-path routing. In: Proc. of the 10th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), Proceedings in Informatics, vol.\u00a017, pp. 163\u2013177. Carleton Scientific (2003)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T21:33:03Z","timestamp":1553031183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}