Abstract
Given a graph G = (V, E) with |V| = n, |E| = m, and a source node s, we consider the problem of finding two disjoint paths from s to two destination nodes t 1 and t 2 with minimum total length, for every pair nodes t 1, t 2 ā Vā{s}. One efficient solution is to transform this problem into the problem of finding shortest pairs of disjoint paths, and use the Suurablle-Tarjan algorithm to solve the new problem in O(n 2 log n) time and O(n 2) space. We present an algorithm that solves this problem in O(n 2) time and O(n 2) space, with the solution paths are implicitly represented. Given such a representation, the time necessary to explicitly construct all the solution paths is O(1) for each edge on the paths. Based on this algorithm, we present another algorithm that solves this problem in O(m log 1ā+ām/n )n time and O(m) space, with the compromise of longer searching time on solution paths.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269ā271 (1959)
Bellman, R.: On a routing problem. Quarterly of Applied Mathematics 16(1), 87ā90 (1958)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton (1962)
Floyd, R.W.: Algorithm 97 (SHORTEST PATH). Communications of the ACM 5(6), 345 (1962)
Warshall, S.: A theorem on boolean matrices. Journal of the ACM 9(1), 11ā22 (1962)
Suurballe, J.W.: Disjoint Paths in a Network. Networks 4, 125ā145 (1974)
Suurballe, J.W., Tarjan, R.E.: A Quick Method for Finding Shortest Pairs of Disjoint Paths. Networks 14, 325ā336 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, B., Zheng, S.Q. (2006). Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_20
Download citation
DOI: https://doi.org/10.1007/11750321_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)