Abstract
We consider a 2-edge connected, undirected graph G=(V,E), with n nodes and m non-negatively real weighted edges, and a single source shortest paths tree (SPT) T of G rooted at an arbitrary node r. If an edge in T is temporarily removed, it makes sense to reconnect the nodes disconnected from the root by adding a single non-tree edge, called a swap edge, instead of rebuilding a new optimal SPT from scratch. In the past, several optimality criteria have been considered to select a best possible swap edge. In this paper we focus on the most prominent one, that is the minimization of the average distance between the root and the disconnected nodes. To this respect, we present an O(mlog2 n) time and linear space algorithm to find a best swap edge for every edge of T, thus improving for \(m = o \left( n^2/\log^2 n \right)\) the previously known O(n 2) time and space complexity algorithm.
This work has been partially supported by the Research Project GRID.IT, funded by the Italian Ministry of Education, University and Research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Shariri, M.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1995)
Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 508–515. Springer, Heidelberg (2002)
Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing 13(2), 338–355 (1984)
Hershberger, J.: Finding the upper envelope of n line segments in O(n log n) time. Information Processing Letters 33, 169–174 (1989)
Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest paths tree is good and fast. Algorithmica 36(4), 361–374 (2003)
Proietti, G.: Dynamic maintenance versus swapping: an experimental study on shortest paths trees. In: Näher, S., Wagner, D. (eds.) WAE 2000. LNCS, vol. 1982, pp. 207–217. Springer, Heidelberg (2001)
Proietti, G.: Computing a single swap edge in a shortest paths tree by minimizing the average distance from the root (manuscript) available at http://www.di.univaq.it/~proietti/paper.ps
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. 17, pp. 163–177. Carleton Scientific (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Salvo, A., Proietti, G. (2004). Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-27796-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22230-9
Online ISBN: 978-3-540-27796-5
eBook Packages: Springer Book Archive