Abstract
For a graph and a set of vertex pairs {(s 1, t 1), ..., (s k , t k )}, the k disjoint paths problem is to find k vertex-disjoint paths P 1, ..., P k , where P i is a path from s i to t i for each i = 1, ..., k. In the corresponding optimization problem, the shortest disjoint paths problem, the vertex-disjoint paths P i have to be chosen such that a given objective function is minimized. We consider two different objectives, namely minimizing the total path length (minimum sum, or short: min-sum), and minimizing the length of the longest path (min-max), for k = 2, 3.
min-sum: We extend recent results by Colin de Verdière and Schrijver to prove that, for a planar graph and for terminals adjacent to at most two faces, the Min-Sum 2 Disjoint Paths Problem can be solved in polynomial time. We also prove that, for six terminals adjacent to one face in any order, the Min-Sum 3 Disjoint Paths Problem can be solved in polynomial time.
min-max: The Min-Max 2 Disjoint Paths Problem is known to be NP-hard for general graphs. We present an algorithm that solves the problem for graphs with tree-width 2 in polynomial time. We thus close the gap between easy and hard instances, since the problem is weakly NP-hard for graphs with tree-width at least 3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23(1), 11–24 (1989)
de Verdière, É.C., Schrijver, A.: Shortest vertex-disjoint two-face paths in planar graphs. In: STACS, pp. 181–192 (2008)
Edelsbrunner, H., Mücke, E.P.: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics 9(1), 66–104 (1990)
Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111–121 (1980)
Frank, A.: Packing paths, cuts and circuits – a survey. In: Paths, Flows, and VLSI-Layout, pp. 49–100. Springer, Heidelberg (1990)
Halin, R.: S-functions for graphs. Journal of Geometry 8(1-2), 171–186 (1976)
Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277–286 (1981)
Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45–68 (1975)
Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. Technical Report METR 2009-38, Department of Mathematical Informatics, University of Tokyo (2009)
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)
Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. SIGDA Newsletter 5(3), 31–36 (1975)
Ogier, R.G., Rutenburg, V., Shacham, N.: Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Transactions on Information Theory 39(2), 443–455 (1993)
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 309–322 (1986)
Robertson, N., Seymour, P.D.: An outline of a disjoint paths algorithm. In: Paths, Flows, and VLSI-Layout, pp. 267–292. Springer, Heidelberg (1990)
Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B 63(1), 65–110 (1995)
Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical Report 396, Technische Universität Berlin (1994)
Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM Journal on Computing 23(4), 780–788 (1994)
Seymour, P.D.: Disjoint paths in graphs. Discrete Mathematics 29, 293–309 (1980)
Shiloach, Y.: A polynomial solution to the undirected two paths problem. Journal of the ACM 27(3), 445–456 (1980)
Srinivas, A., Modiano, E.: Finding minimum energy disjoint paths in wireless ad-hoc networks. Wireless Networks 11(4), 401–417 (2005)
Tardos, É.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3), 247–256 (1985)
Thomassen, C.: 2-linked graphs. European Journal of Combinatorics 1, 371–378 (1980)
Yang, B., Zheng, S.-Q., Katukam, S.: Finding two disjoint paths in a network with min-min objective function. In: 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 normalized α −-min-sum objective function. In: IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 342–348 (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
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, Y., Sommer, C. (2009). On Shortest Disjoint Paths in Planar Graphs. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)