Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
Given a spanning tree T of a 2-edge connected, weighted graph G, a swap edge for a failing edge e in T is an edge é of G reconnecting the two subtrees of T created bythe removal of e. A best swap edge is a swap edge enjoying the additional property of optimizing the swap, with respect to a given objective function. If the spanning tree is a single source shortest paths tree rooted in a node r, say S(r), it has been shown that there exist efficient algorithms for finding a best swap edge, for each edge e in S(r) and with respect to several objective functions. These algorithms are efficient both in terms of the functionalities of the trees obtained as a consequence of the swaps, and of the time spent to compute them. In this paper we propose an extensive experimental analysis of the above algorithms, showing that their actual behaviour is much better than what it was expected from the theoretical analysis.
Unable to display preview. Download preview PDF.
- 4.D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fullydy namic output bounded single source shortest path problem, Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA’96), 1996, 212–221.Google Scholar
- 5.D. Frigioni, M. Ioffreda, U. Nanni and G. Pasquale, Experimental analysis of dynamic algorithms for the single-source shortest-path problem, ACM J. of Experimental Algorithms, 3, article 5, (1998).Google Scholar
- 7.F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.Google Scholar
- 11.E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, 6th European Symp. on Algorithms (ESA’98), Springer-Verlag, LNCS 1461, 55–66, 1998.Google Scholar
- 12.E. Nardelli, G. Proietti and P. Widmayer, How to swap a failing edge of a single source shortest paths tree, 5th Annual Int. Computing and Combinatorics Conf. (COCOON’99), Springer-Verlag, LNCS 1627, 144–153, 1999.Google Scholar
- 15.R.E. Tarjan, Sensitivityanaly sis of minimum spanning trees and shortest path trees, Inf. Proc. Letters, 14(1) (1982) 30–33.Google Scholar