Abstract
Given a graph G = (V, E) and k source-sink pairs {(s 1, t 1), ..., (s k , t k )} with each s i , t i ∈ V, the Min-Sum Disjoint Paths problem asks k disjoint paths to connect all the source-sink pairs with minimized total length, while the Min-Max Disjoint Paths problem asks also k disjoint paths to connect all source-sink pairs but with minimized length of the longest path. In this paper we show that the weighted Min-Sum Disjoint Paths problem is FP NP-complete in general graph, and the uniform Min-Sum Disjoint Paths and uniform Min-Max Disjoint Paths problems can not be approximated within Ω(m 1 − ε) for any constant ε> 0 even in planar graph if P ≠ NP, where m is the number of edges in G. Then we give at the first time a simple bicriteria approximation algorithm for the uniform Min-Max Edge-Disjoint Paths and the weighted Min-Sum Edge-Disjoint Paths problems, with guaranteed performance ratio O(logk / loglogk) and O(1) respectively. Our algorithm is based on randomized rounding.
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
Brandes, U., Neyer, G., Wagner, D.: Edge-disjoint paths in planar graphs with short total length. Technical Report, in Konstanzer Schriften in Mathematik und Informatik, No. 19, Germany (1996)
Chekuri, C., Khanna, S.: Edge disjoint pahts revisited. In: Proc. of the 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 628–637. ACM Press, New York (2003)
Garg, N., Vazirani, V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing 25, 235–251 (1996)
Kleinberg, J.: Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, Cambridge, MA (1996)
Kleinberg, J.: An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs. In: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 627–636. IEEE Computer Society Press, Los Alamitos (2005)
Li, C., McCormick, T., Simchi-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Applied Mathematics 26, 105–115 (1990)
Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97–107 (1993)
Papadimitriou, C.: Computational complexity. Addison-Wesley Publishing Company, Reading (1994)
Raghavan, P., Thompson, C.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365–374 (1987)
Suurballe, J., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)
Yang, B., Zheng, S.Q., Lu, E.Y.: Finding two disjoint paths in a network with normalized α + -min-sum objective function. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 954–963. Springer, Heidelberg (2005)
Yang, B., Zheng, S.Q.: Finding min-sum disjoint shortest paths from a single source to all pairs of destinations. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 206–216. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, P., Zhao, W. (2007). On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)