Abstract
We show that the problem of computing a pair of disjoint paths between nodes s and t of an undirected graph, each having at most K, K ε Z +, edges is NP-complete. A heuristic for its optimization version is given whose performance is within a constant factor from the optimal. It can be generalized to compute any constant number of disjoint paths. We also generalize an algorithm in [1] to compute the maximum number of edge disjoint paths of the shortest possible length between s and t. We show that it is NP-complete to decide whether there exist at least K, K ε Z +, disjoint paths that may have at most S+1 edges, where S is the minimum number of edges on any path between s and t. In addition, we examine a generalized version of the problem where disjoint paths are routed either between a node pair (s1, t1) or a node pair (s2, t2). We show that it is NP-hard to find the maximum number of disjoint paths that either connect pair (s1, t1) the shortest way or (s2, t2) the shortest way.
Preview
Unable to display preview. Download preview PDF.
References
Itai A., Perl Y., Shiloach Y.: The Complexity of Finding Maximum Disjoint Paths with Length Constraints. Networks 12 (1982) 277–286
Garey M.R., Johnson D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, NY, 1979
Shiloach Y.: The Two Paths Problem is Polynomially Solvable. Report STAN-CS-78-654. Computer Science Department, Stanford University, Stanford, CA
Suurballe, J.W.: Disjoint Paths in a Network. Networks 4 (1974) 125–145
Suurballe, J.W., Tarjan, R.E.: A Quick Method for Finding Shortest Pairs of Disjoint Paths. Networks 14 (1984) 325–336
Tragoudas, S., Varol Y.L.: On the Computation of Disjoint Paths with Length Constraints. Technical Report 96-6. Computer Science Department, Southern Illinois Univerity, Carbondale, IL 62901
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tragoudas, S., Varol, Y.L. (1997). Computing disjoint paths with length constraints. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-62559-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62559-9
Online ISBN: 978-3-540-68072-7
eBook Packages: Springer Book Archive