Skip to main content

Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3959))

  • 1161 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics