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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 210-221

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

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

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

Indexed keywords

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

ALGORITHMS; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

EID: 72249097356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_17     Document Type: Conference Paper

References (31)

1. Adámek, J., Koubek, V.: Remarks on flows in network with short paths. Commentationes Mathematicae Universitatis Carolinae 12(4), 661-667 (1971)
2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42, 844-856 (1995)
3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308-340 (1991)
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)
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)
6. Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complexity 12, 131-149 (2003)
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)
8. Borie, R.B.: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs. Algorithmica 14, 123-137 (1995)
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)
10. Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)
11. Exoo, G.: On line disjoint paths of bounded length. Discrete Math. 44, 317-318 (1983)
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)
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)
14. Flum, J., Grohe, M.: Parameterized complexity theory, Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)
15. Ford Jr., L.R., Fulkerson, D.R.: Maximal flow through a network. Canad. J. Math. 8, 399-404 (1956)
16. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111-121 (1980)
17. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. System Sci. 67, 473-496 (2003)
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 Erdocombining double acute accents on the occasion of his 80th birthday (Special Section on Discrete Mathematics and Its Applications)
19. Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12, 277-286 (1982)
20. Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45-68 (1975)
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)
22. Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. Journal of Algorithms 61(1), 20-44 (2006)
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)
24. Lovász, L., Neumann Lara, V., Plummer, M.: Mengerian theorems for paths of bounded length. Period. Math. Hungar. 9, 269-276 (1978)
25. Menger, K.: Über reguläre Baumkurven. Math. Ann. 96, 572-582 (1927)
26. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press, Oxford (2006)
27. Niepel, L., Šafaříková, D.: On a generalization of Menger's theorem. Acta Math. Univ. Comenian. 42, 43, 275-284 (1983)
28. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory. Series B 63, 65-110 (1995)
29. Ronen, D., Perl, Y.: Heuristics for finding a maximum number of disjoint bounded paths. Networks 14, 531-544 (1984)
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)
31. Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15, 135-150 (1995)