Paths of bounded length and their cuts: Parameterized complexity and algorithms

Discrete Optimization

Volumn 8, Issue 1, 2011, Pages 72-86

  Golovach, Petr A ^a   Thilikos, Dimitrios M ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Bounded length cuts; Bounded length disjoint paths; Parameterized algorithms; Parameterized complexity

Indexed keywords

BOUNDED LENGTH CUTS; DISJOINT PATHS; DISJOINT PATHS PROBLEM; HARDNESS RESULT; INPUT GRAPHS; MENGER'S THEOREM; NP-HARD; PARAMETERIZATIONS; PARAMETERIZED; PARAMETERIZED ALGORITHMS; PARAMETERIZED COMPLEXITY; SINGLE SOURCE; TREE-WIDTH;

ALGORITHMS; PARAMETERIZATION;

GRAPH THEORY;

EID: 79952187274     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2010.09.009     Document Type: Article

References (36)

1. K. Menger ber regulre Baumkurven Math. Ann. 96 1927 572 582
2. G.B. Dantzig, and D.R. Fulkerson On the max-flow min-cut theorem of networks Linear Inequalities and Related Systems Annals of Mathematics Studies vol. 38 1956 Princeton University Press Princeton, NJ 215 221
3. L.R. Ford Jr., and D.R. Fulkerson Maximal flow through a network Canad. J. Math. 8 1956 399 404
4. J. Admek, and V. Koubek Remarks on flows in network with short paths Comment. Math. Univ. Carolin. 12 4 1971 661 667
5. L. Lovsz, V. Neumann Lara, and M. Plummer Mengerian theorems for paths of bounded length Period. Math. Hungar. 9 1978 269 276
6. G. Exoo On line disjoint paths of bounded length Discrete Math. 44 1983 317 318
7. L. Niepel, and D. afakov On a generalization of Menger's theorem Acta Math. Univ. Comenian. 4243 1983 275 284
8. A. Itai, Y. Perl, and Y. Shiloach The complexity of finding maximum disjoint paths with length constraints Networks 12 1982 277 286 (Pubitemid 13491782)
9. G. Baier, T. Erlebach, A. Hall, E. Khler, H. Schilling, and M. Skutella Length-bounded cuts and flows Automata, Languages and Programming. Part I Lecture Notes in Comput. Sci. vol. 4051 2006 Springer Berlin 679 690 (Pubitemid 44113339)
10. G. Baier, T. Erlebach, A. Hall, E. Khler, P. Kolman, O. Pangrc, H. Schilling, M. Skutella, Length-bounded cuts and flows, ACM Trans. Algorithms (in press).
11. A. Bley On the complexity of vertex-disjoint length-restricted path problems Comput. Complexity 12 2003 131 149 (Pubitemid 39307930)
12. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems J. Comput. System Sci. 67 2003 473 496
13. L. Fleischer, and M. Skutella The quickest multicommodity flow problem Integer Programming and Combinatorial Optimization Lecture Notes in Comput. Sci. vol. 2337 2002 Springer Berlin 36 53
14. P. Kolman, and C. Scheideler Improved bounds for the unsplittable flow problem Proceedings of the Symposium on Discrete Algorithms 2002 ACM 184 193
15. P. Kolman, and C. Scheideler Improved bounds for the unsplittable flow problem J. Algorithms 61 1 2006 20 44 (Pubitemid 44767713)
16. D. Ronen, and Y. Perl Heuristics for finding a maximum number of disjoint bounded paths Networks 14 1984 531 544 (Pubitemid 14663842)
17. D. Wagner, and K. Weihe A linear-time algorithm for edge-disjoint paths in planar graphs Combinatorica 15 1995 135 150
18. D. Hsu On container width and length in graphs, groups, and networks IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 77 4 1994 668 680 Dedicated to Professor Paul Erds on the occasion of his 80th birthday (Special Section on Discrete Mathematics and its Applications)
19. R.M. Karp On the computational complexity of combinatorial problems Networks 5 1 1975 45 68 (Proceedings of the Symposium on Large-Scale Networks, Evanston, IL, USA, 1819 April 1974)
20. N. Robertson, and P.D. Seymour Graph minors. XIII. The disjoint paths problem J. Combin. Theory Ser. B 63 1995 65 110
21. S. Fortune, J. Hopcroft, and J. Wyllie The directed subgraph homeomorphism problem Theoret. Comput. Sci. 10 1980 111 121
22. R.G. Downey, and M.R. Fellows Parameterized Complexity Monographs in Computer Science 1999 Springer-Verlag New York
23. J. Flum, and M. Grohe Parameterized Complexity Theory Texts in Theoretical Computer Science. An EATCS Series 2006 Springer-Verlag Berlin
24. R. Niedermeier Invitation to Fixed-Parameter Algorithms Oxford Lecture Series in Mathematics and its Applications vol. 31 2006 Oxford University Press Oxford
25. C.-L. Li, T. McCormick, and D. Simchi-Levi The complexity of finding two disjoint paths with minmax objective function Discrete Appl. Math. 26 1990 105 115
26. S. Tragoudas, and Y.L. Varol Computing disjoint paths with length constraints Graph-Theoretic Concepts in Computer Science Cadenabbia, 1996 Lecture Notes in Comput. Sci. vol. 1197 1997 Springer Berlin 375 389 (Pubitemid 127032645)
27. N. Alon, R. Yuster, and U. Zwick Color-coding J. Assoc. Comput. Mach. 42 1995 844 856
28. M. Fellows, D. Hermelin, F. Rosamond, and S. Vialette On the parameterized complexity of multiple-interval graph problems Theoret. Comput. Sci. 410 2009 53 61
29. S. Arnborg, J. Lagergren, and D. Seese Easy problems for tree-decomposable graphs J. Algorithms 12 1991 308 340
30. R.B. Borie Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs Algorithmica 14 1995 123 137
31. J. Kratochvl A special planar satisfiability problem and a consequence of its NP-completeness Discrete Appl. Math. 52 1994 233 252
32. M. Dom, D. Lokshtanov, S. Saurabh, and Y. Villanger Capacitated domination and covering: a parameterized perspective IWPEC'08 LNCS vol. 5018 2008 Springer 78 90 (Pubitemid 351775561)
33. H. Bodlaender, D. Lokshtanov, and E. Penninkx Planar capacitated dominating set is W [ 1 ] -hard IWPEC'09 LNCS vol. 5917 2009 Springer 50 60
34. F.V. Fomin, P.A. Golovach, D. Lokshtanov, and S. Saurabh Algorithmic lower bounds for problems parameterized with clique-width SODA'10 2010 ACM-SIAM 493 502
35. H.L. Bodlaender, R.G. Downey, M.R. Fellows, and D. Hermelin On problems without polynomial kernels J. Comput. System Sci. 75 8 2008 423 434
36. P.A. Golovach, and D.M. Thilikos Paths of bounded length and their cuts: parameterized complexity and algorithms IWPEC'09 LNCS vol. 5917 2009 Springer 210 221