A 2-approximation algorithm for the directed multiway cut problem

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 477-482

  Naor, Joseph ^a   Zosin, Leonid ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b ITG Inc   (United States)

Author keywords

Approximation algorithms; Combinatorial optimization; Directed graph; Multicommodity fbw; Multiway cut

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

MULTIWAY CUT PROBLEMS;

GRAPH THEORY;

EID: 0036242991     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732147X     Document Type: Article

References (7)

1. G. CALINESCU, H. KARLOFF, AND Y. RABANI, An improved approximation algorithm for multiway cut, J. Comput. System Sci., 60 (2000), pp. 564-574.
2. E. DAHLHAUS, D. S. JOHNSON, C. H. PAPADIMITRIOU, P. D. SEYMOUR, AND M. YANNAKAKIS, The complexity of multiterminal cuts, SIAM J. Comput., 23 (1994), pp. 864-894.
3. G. EVEN, J. (S.) NAOR, AND L. ZOSIN, An 8-approximation algorithm for the subset feedback vertex set problem, SIAM J. Comput., 30 (2000), pp. 1231-1252.
4. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Multiway cuts in directed and node weighted graphs, in Proceedings of the 21st International Colloquium on Automata, Languages, and Programming, 1994, Jerusalem, Israel, pp. 487-498.
5. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
6. D. R. KARGER, P. N. KLEIN, C. STEIN, M. THORUP, AND N. E. YOUNG, Rounding algorithms for a geometric embedding of minimum multiway cut, in Proceedings of the 31st Annual Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 668-678.
7. J. NAOR AND L. ZOSIN, A 2-approximation algorithm for the directed multiway cut problem, in Proceedings of the 38th IEEE Conference on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 548-553.