Abstract
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSum-MinMin and MinSum-MinMax. We use the algorithm by Perl-Shiloach and labelling and scaling techniques to devise an FPTAS for the first three objectives. For the forth one, we propose a general and efficient polynomial-time algorithm.
This work is supported by National Natural Science Fund (grants #60573025, #60496321, #60373021) and Shanghai Science and Technology Development Fund (grant #03JC14014).
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.
Similar content being viewed by others
References
Ahuja, P.K., Magnanti, T.L., Orlin, J.B.: Network Flows, Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000)
Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homemorphism problem. Theoretical Computer Science 10, 111–121 (1980)
Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)
Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17, 237–260 (1992)
Ibarra, O.H., Kim, C.E.: Fast approximation for the knapsack and sum of subset problems. JACM 22, 463–468 (1975)
Li, C.L., McCormick, S.T., Simchi-Levi, D.: The complexity of finding two disjoint paths with Min-Max objective function. Discrete Applied Mathematics 26(1), 105–115 (1990)
Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM 25(1), 1–9 (1978)
Suurballe, J.W., Tarjan, R.: A quick method for finding shortest pairs of disjoint paths. Networks 14, 325–336 (1984)
Tsaggouris, G., Zaroliagis, C.: Improved FPTAS for Multiobjective Shortest Paths with Applications. CTI Technical Report TR 2005/07/03 (July 2005)
Yang, B., Zheng, S.Q., Katukam, S.: Finding two disjoint paths in a network with Min-Min objective function. In: Proc. 15th IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 75–80 (2003)
Yang, B., Zheng, S.Q., Lu, E.: Finding two disjoint paths in a network with MinSum-MinMin objective function. Technical Report, Dept. of Computer Science, Univ. of Texas at Dallas (April 2005)
Yang, B., Zheng, S.Q., Lu, E.: 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)
Author information
Authors and Affiliations
Editor information
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Fleischer, R., Ge, Q., Li, J., Zhu, H. (2007). Efficient Algorithms for k-Disjoint Paths Problems on DAGs. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-72870-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72868-9
Online ISBN: 978-3-540-72870-2
eBook Packages: Computer ScienceComputer Science (R0)