Abstract
The edge-disjoint paths problem and many special cases of it are known to be NP-complete. We present a new NP-completeness result for a special case of the problem, namely the directed edge-disjoint paths problem restricted to planar supply graphs and demand graphs consisting of two sets of parallel edges.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5, 691–703 (1976)
Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45–68 (1975)
Korach, E., Penn, M.: A fast algorithm for maximum integral two-commodity flow in planar graphs. Discrete Appl. Math. 47, 77–83 (1993)
Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin, 2000
Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) VLSI-Theory Advances in Computing Research, Volume 2. JAI Press, Greenwich, Connecticut, 1984
Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329–343 (1982)
Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97–107 (1993)
Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM J. Comput. 23, 780–788 (1994)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin, 2003
Sebő, A.: Integer plane multiflows with a fixed number of demands. J. Comb. Theory Ser. B 59, 163–171 (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Müller, D. On the complexity of the planar directed edge-disjoint paths problem. Math. Program. 105, 275–288 (2006). https://doi.org/10.1007/s10107-005-0653-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0653-9