Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs

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

Volumn 2832, Issue , 2003, Pages 482-493

  Slivkins, Aleksandrs ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

ACYCLIC DIGRAPH; DEMAND GRAPHS; DIRECTED ACYCLIC GRAPH (DAG); EDGE DISJOINT PATHS; PARAMETERIZED; POSITIVE SIDES; ROUTING PROBLEMS; UNSPLITTABLE FLOW PROBLEMS;

GRAPH THEORY;

EID: 0142152725     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_44     Document Type: Article

References (19)

1. G. Baier, E. Köhler and M. Skutella, "On the k-Splittable Flow Problem," Proc. 10th Annual European Symposium on Algorithms, 2002.
2. Y. Dinitz, N. Garg and M. Goemans "On the Single-Source Unsplittable Flow Problem," Proc. 39th Annual Symposium on Foundations of Computer Science, 1998.
3. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto and F. Rosamund, "Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems," Computing: The Australasian Theory Symposium, 2003.
4. R.G. Downey and M.R. Fellows, Parameterized Complexity, Springer-Verlag (1999).
5. S. Even, A. Itai and A. Shamir, "On the complexity of timetable and multicommodity flow problems," SIAM J. Computing, 5 (1976) 691-703.
6. S. Fortune, J. Hopcroft and J. Wyllie, "The directed subgraph homeomorphism problem," Theoretical Computer Science, 10 (1980) 111-121.
7. B. Korte, L. Lovász, H-J. Prömel, A. Schrijver, eds., Paths, Flows and VLSI-Layouts, Springer-Verlag (1990).
8. R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., Plenum Press, New York (1972) 85-103.
9. J. Kleinberg, "Single-source unsplittable flow," Proc. 37th Annual Symposium on Foundations of Computer Science, 1996.
10. -, "Decision algorithms for unsplittable flow and the half-disjoint paths problem," Proc. 30th Annual ACM Symposium on the Theory of Computing, 1998.
11. -, "Approximation Algorithms for Disjoint Paths Problems," Ph.D. Thesis, M.I.T, 1996.
12. S.G. Kolliopoulos and C. Stein, "Improved approximation algorithms for unsplittable flow problems," Proc. 38th Annual Symposium on Foundations of Computer Science, 1997.
13. C.L. Lucchesi and D.H. Younger, "A minimax relation for directed graphs," J. London Mathematical Society 17 (1978) 369-374.
14. N. Robertson and P.D. Seymour, "Graph minors XIII. The disjoint paths problem," J. Combinatorial Theory Ser. B 63 (1995) 65-110.
15. A. Schrijver, "Finding k disjoint paths in a directed planar graph," SIAM J. Computing 23 (1994) 780-788.
16. Y. Shiloach, "A polynomial solution to the undirected two paths problem," J. of the ACM 27 (1980) 445-456.
17. M. Skutella, "Approximating the single source unsplittable min-cost flow problem," Mathematical Programming Ser. B 91(3) (2002) 493-514.
18. J. Vygen, "NP-completeness of some edge-disjoint paths problems," Discrete Appl. Math. 61 (1995) 83-90.
19. -, "Disjoint paths," Rep. #94846, Research Inst. for Discrete Math., U. of Bonn (1998).