Multiway cuts in node weighted graphs

Chvat́al, 1983 Calinescu, 2000, An improved approximation algorithm for multiway cut, J. Comput. System Sci., 60, 564, 10.1006/jcss.1999.1687 Cunningham, 1999, Optimal 3-terminal cuts and linear programming, 114 Dahlhaus, 1994, The complexity of multiterminal cuts, SIAM J. Comput., 23, 864, 10.1137/S0097539792225297 Even, 1996, Approximating minimum subset feedback sets in undirected graphs, with applications, 78 Even, 1996, An 8-approximation algorithm for the subset feedback vertex set problem, 310 Garg, 1996, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput., 25, 235, 10.1137/S0097539793243016 Garg, 1994, Multiway cuts in directed and node weighted graphs, 487 Karger, 1999, Rounding algorithms for a geometric embedding of minimum multiway cut, 668 Naor, 1997, A 2-approximation algorithm for the directed multiway cut problem, 548 Papadimitriou, 1991, Optimization, approximation and complexity classes, J. Comput. System Sci., 43, 425, 10.1016/0022-0000(91)90023-X