Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Journal of Algorithms

Volumn 48, Issue 2, 2003, Pages 333-359

  Cǎlinescu, Gruia ^a   Fernandes, Cristina G ^b   Reed, Bruce ^a,c  

^a Illinois Institute of Technology   (United States)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c CNRS   (France)

Author keywords

Approximation algorithms; Multicut; Polynomial time approximation schemes; Tree width

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

MULTICUT;

TREES (MATHEMATICS);

EID: 0042929930     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00073-7     Document Type: Article

References (25)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.
2. S. Amborg, J. Lagergren, Problems easy for tree-decomposable graphs, J. Algorithms 12 (2) (1991) 308-340.
3. E. Dahinaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, M. Yannakakis, The complexity of multiterminal cuts, SIAM J. Comput. 23 (4) (1994) 864-894.
4. E.A. Dinic, Algorithm for solution of a problem of maximum flow in networks with power estimation, Soviet Math. Dokl. 11 (1970) 1277-1280.
5. L.R. Ford, D.R. Fulkerson, Maximal flow through a network, Canad. J. Math. 8 (1956) 399-404.
6. L.R. Ford, D.R. Fulkerson, A suggested computation for maximal multicommodity network flows, Manage. Sci. 5 (1958) 97-101.
7. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, 1979.
8. N. Garg, V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs, in: Proc. 21st International Colloquium on Automata, Languages, and Programming, in: Lecture Notes in Comput. Sci., Vol. 820, Springer-Verlag, 1994, pp. 487-98.
9. N. Garg, V. Vazirani, M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput. 25 (2) (1996) 235-251.
10. N. Garg, V. Vazirani, M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1) (1997) 3-20.
11. D. Harel, R.E. Tarjan, Fast algorithms for finding nearest common ancestor, SIAM J. Comput. 13 (2) (1984) 338-355.
12. T.C. Hu, Multicommodity network flows, Oper. Res. 9 (1963) 898-900.
13. A. Itai, Two-commodity flow, J. ACM 25 (1978) 596-611.
14. T. Johnson, N. Robertson, P.D. Seymour, R. Thomas, Directed tree-width, J. Combin. Theory Ser. B, to appear.
15. P. Klein, S. Plotkin, S. Rao, Excluded minors, network decomposition, and multicommodity flow, in: Proc. 25th ACM Symposium on Theory of Computing, 1993, pp. 682-690.
16. P. Klein, S. Plotkin, S. Rao, E. Tardos, Approximation algorithms for Steiner and directed multicuts, J. Algorithms 22 (2) (1997) 241-269.
17. P. Klein, S. Rao, A. Agrawal, R. Ravi, An approximate max-flow min-cut relation for undirected multicommodity flow, with applications, Combinatorica 15 (2) (1995) 187-202.
18. F.T. Leighton, S. Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (6) (1999) 787-832.
19. D.B. Shmoys, Computing near-optimal solutions to combinatorial optimization problems, in: W. Cook, L. Lovász (Eds.), Combinatorial Optimization, in: DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Vol. 20, Amer. Math. Society, 1995, pp. 355-397.
20. S. Plotkin, E. Tardos, Improved bounds on the max-flow min-cut ratio for multicommodity flows, in: Proc. 25th Annual ACM Symp. on Theory of Computing, 1993, pp. 691-697.
21. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
22. N. Robertson, P. Seymour, Graph minor II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986) 309-322.
23. N. Robertson, P. Seymour, Graph minor III. Planar tree-width, J. Combin. Theory Ser. B 36 (1984) 49-63.
24. r,r-free graphs, Inform. Process. Lett. 47 (2) (1993) 77-80.
25. J. van Leeuwen, Graph Algorithms, Chapter 10, in: Handbook of Theoretical Computer Science, Vol. A, MIT Press, 1990, pp. 525-631.