Multiway cuts in node weighted graphs

Journal of Algorithms

Volumn 50, Issue 1, 2004, Pages 49-61

  Garg, Naveen ^a   Vazirani, Vijay V ^b   Yannakakis, Mihalis ^c  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; INTEGRAL EQUATIONS; LINEAR PROGRAMMING; THEOREM PROVING;

APPROXIMATION ALGORITHM; COMINATORIAL OPTIMIZATION; HALF INTEGRAL OPTIMAL SOLUTION; MULTIWAY CUT PROBLEM; WEIGHTED GRAPHS;

ALGORITHMS;

EID: 0346009267     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00111-1     Document Type: Article

References (11)

1. V. Chvat́al, Linear Programming, Freeman, 1983.
2. G. Calinescu, H. Karloff, Y. Rabani, An improved approximation algorithm for multiway cut, J. Comput. System Sci. 60 (3) (2000) 564-574.
3. W.H. Cunningham, L. Tang, Optimal 3-terminal cuts and linear programming, in: Proc. 7th Symp. on Integer Programming and Combinatorial Optimization, 1999, pp. 114-125.
4. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, M. Yannakakis, The complexity of multiterminal cuts, SIAM J. Comput. 23 (4) (1994) 864-894.
5. G. Even, J. Naor, B. Schieber, L. Zosin, Approximating minimum subset feedback sets in undirected graphs, with applications, in: Proc. 4th ISTCS, 1996, pp. 78-88.
6. G. Even, J. Naor, L. Zosin, An 8-approximation algorithm for the subset feedback vertex set problem, in: Proc. 37th Ann. IEEE Symp. on Foundations of Computer Science, 1996, pp. 310-319.
7. N. Garg, V.V. Vazirani, M. Yannakakis, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput. 25 (2) (1996) 235-251.
8. N. Garg, V.V. Vazirani, M. Yannakakis, Multiway cuts in directed and node weighted graphs, in: Proc. 21st Intl. Coll. Automata, Languages and Programming, 1994, pp. 487-498.
9. D.R. Karger, P.N. Klein, C. Stein, M. Thorup, N.E. Young, Rounding algorithms for a geometric embedding of minimum multiway cut, in: Proc. 31st ACM Symposium on Theory of Computing, 1999, pp. 668-678.
10. J. Naor, L. Zosin, A 2-approximation algorithm for the directed multiway cut problem, in: Proc. 38th Ann. IEEE Symp. on Foundations of Computer Science, 1997, pp. 548-553.
11. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.