Greedy approximation algorithms for Directed Multicuts

Networks

Volumn 45, Issue 4, 2005, Pages 214-217

  Kortsarts, Yana ^a   Kortsarz, Guy ^b   Nutov, Zeev ^c  

^a WIDENER UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation; Directed; Graphs; Multicuts

Indexed keywords

DIRECTED; EMULATIONS; LOGARITHMS; MULTICUTS;

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

GRAPH THEORY;

EID: 21944457043     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20066     Document Type: Article

References (13)

1. J. Cheriyan, H. Karloff, and Y. Rabani, Approximating directed multicuts, Combinatorica, to appear.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to algorithms, 2nd ed., MIT Press, Cambridge, MA; 1998.
3. S. Even, Graph algorithms, Computer Science Press, Haifa, 1979.
4. G. Even, S. Naor, B. Schieber, and S. Rao, Divide-and-conquer approximation algorithms via spreading metrics, ACM 47(2000), 585-616.
5. L. Fleischer, Approximating fractional multicommodity flows independent of the number of commodities, SIAM J Discrete Math 13(2000), 505-520.
6. L.R. Ford and D.R. Fulkerson. Flows in networks, Princeton University Press, Princeton, NJ, 1962.
7. N. Garg, V. Vazirani, and M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, SIAM Comput 25(1996), 235-251.
8. N. Garg, V. Vazirani, and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18(1997), 3-20.
9. A. Gupta, Improved approximation algorithm for directed multicut, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp. 12-14.
10. D.S. Hochbaum (editor), Approximation algorithms for NP-hard problems, PWS Publishing Company, Boston, MA, 1997.
11. P.N. Klein, S.A. Plotkin, S. Rao, and E. Tardos, Approximation algorithms for Steiner and directed multicuts, J. Algorithms 22(1997), 241-269.
12. P.D. Seymour, Packing directed circuits fractionally, Combinatorica 15(1995), 281-288.
13. K. Varadarajan and G. Venkataraman, Graph decomposition and a greedy algorithm for edge-disjoint paths, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 379-380.