Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts.

Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki

Browse the full ISAAC paper archive.