Liang Zhao, Hiroshi Nagamochi, Toshihide Ibaraki. Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. In Alok Aggarwal, C. Pandu Rangan, editors, Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings. Volume 1741 of Lecture Notes in Computer Science, pages 373-382, Springer, 1999. [doi]
Abstract is missing.