most citedRounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

71 citations · 71 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2002★ 71 cited

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

David Karger, Phil Klein, Cliff Stein +2

The multiway-cut problem is, given a weighted graph and k >= 2 terminal nodes, to find a minimum-weight set of edges whose removal separates all the terminals. The problem is NP-ha…