Skip to main content
SpringerLink
Log in

Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

  • Conference paper
Parameterized and Exact Computation (IWPEC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5917))

Included in the following conference series:

Abstract

We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both problems are equivalent (and computationally easy) in the unbounded case for single source, single target paths. However, in the bounded case, they are combinatorially distinct and are both NP-hard, even to approximate. Our results indicate that a more refined landscape appears when we study these problems with respect to their parameterized complexity. For this, we consider several parameterizations (with respect to the maximum length l of paths, the number k of paths or the size of a cut, and the treewidth of the input graph) of all variants of both problems (edge/vertex-disjoint paths or cuts, directed/undirected). We provide FPT-algorithms (for all variants) when parameterized by both k and l and hardness results when the parameter is only one of k and l. Our results indicate that the bounded length disjoint-path variants are structurally harder than their bounded length cut counterparts. Also, it appears that the edge variants are harder than their vertex-disjoint counterparts when parameterized by the treewidth of the input graph.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adámek, J., Koubek, V.: Remarks on flows in network with short paths. Commentationes Mathematicae Universitatis Carolinae 12(4), 661–667 (1971)

    MATH  MathSciNet  Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42, 844–856 (1995)

    MATH  MathSciNet  Google Scholar 

  3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baier, G., Erlebach, T., Hall, A., Köhler, E., Schilling, H., Skutella, M.: Length-bounded cuts and flows. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 679–690. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Baier, G., Erlebach, T., Hall, A., Köhler, E., Kolman, P., Pangrác, O., Schilling, H., Skutella, M.: Length-bounded cuts and flows. ACM Transactions in Algorithms (to appear)

    Google Scholar 

  6. Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complexity 12, 131–149 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563–574. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  8. Borie, R.B.: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123–137 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dantzig, G.B., Fulkerson, D.R.: On the max-flow min-cut theorem of networks, in Linear inequalities and related systems. Annals of Mathematics Studies, vol. 38, pp. 215–221. Princeton University Press, Princeton (1956)

    Google Scholar 

  10. Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)

    Google Scholar 

  11. Exoo, G.: On line disjoint paths of bounded length. Discrete Math. 44, 317–318 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410, 53–61 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fleischer, L.K., Skutella, M.: The quickest multicommodity flow problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 36–53. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Flum, J., Grohe, M.: Parameterized complexity theory, Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)

    Google Scholar 

  15. Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canad. J. Math. 8, 399–404 (1956)

    MATH  MathSciNet  Google Scholar 

  16. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111–121 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  17. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. System Sci. 67, 473–496 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hsu, D.: On container width and length in graphs, groups, and networks. IEICE transactions on fundamentals of electronics, communications and computer sciences 77, 668–680 (1994); Dedicated to Professor Paul Erdős on the occasion of his 80th birthday (Special Section on Discrete Mathematics and Its Applications)

    Google Scholar 

  19. Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277–286 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45–68 (1975)

    MATH  Google Scholar 

  21. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the Symposium on Discrete Algorithms, pp. 184–193. ACM, New York (2002)

    Google Scholar 

  22. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. Journal of Algorithms 61(1), 20–44 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  23. Li, C.-L., McCormick, T., Simchi-Levi, D.: The complexity of finding two disjoint paths with min-max objective function. Discrete Appl. Math. 26, 105–115 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  24. Lovász, L., Neumann Lara, V., Plummer, M.: Mengerian theorems for paths of bounded length. Period. Math. Hungar. 9, 269–276 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  25. Menger, K.: Über reguläre Baumkurven. Math. Ann. 96, 572–582 (1927)

    Article  MathSciNet  Google Scholar 

  26. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)

    MATH  Google Scholar 

  27. Niepel, L., Šafaříková, D.: On a generalization of Menger’s theorem. Acta Math. Univ. Comenian. 42, 43, 275–284 (1983)

    Google Scholar 

  28. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory. Series B 63, 65–110 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  29. Ronen, D., Perl, Y.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14, 531–544 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  30. Tragoudas, S., Varol, Y.L.: Computing disjoint paths with length constraints. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 375–389. Springer, Heidelberg (1997)

    Google Scholar 

  31. Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15, 135–150 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Petr A. Golovach

  2. Department of Mathematics, National and Kapodistrian University of Athens, Panepistimioupolis, GR15784, Athens, Greece

    Dimitrios M. Thilikos

Authors
  1. Petr A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dimitrios M. Thilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, College Station, 77843, Texas, USA

    Jianer Chen

  2. Institutt for informatikk, Universitetet i Bergen, Postboks 7803, 5020, Bergen, Norway

    Fedor V. Fomin

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golovach, P.A., Thilikos, D.M. (2009). Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms. In: Chen, J., Fomin, F.V. (eds) Parameterized and Exact Computation. IWPEC 2009. Lecture Notes in Computer Science, vol 5917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11269-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11269-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11268-3

  • Online ISBN: 978-3-642-11269-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation