Kann, Viggo; Lagergren, Jens; Panconesi, Alessandro Approximate Max \(k\)-Cut with subgraph guarantee. (English) Zbl 1338.68221 Inf. Process. Lett. 65, No. 3, 145-150 (1998). MSC: 68R10 05C15 05C85 PDFBibTeX XMLCite \textit{V. Kann} et al., Inf. Process. Lett. 65, No. 3, 145--150 (1998; Zbl 1338.68221) Full Text: DOI Link
Kann, Viggo; Khanna, Sanjeev; Lagergren, Jens; Panconesi, Alessandro On the hardness of approximating Max \(k\)-Cut and its dual. (English) Zbl 0924.68013 Chic. J. Theor. Comput. Sci. 1997, Article no. 2 (1997). MSC: 68M15 68U99 PDFBibTeX XMLCite \textit{V. Kann} et al., Chic. J. Theor. Comput. Sci. 1997, Article no. 2, (1997; Zbl 0924.68013)
Kann, Viggo; Lagergren, Jens; Panconesi, Alessandro Approximability of maximum splitting of k-sets and some other Apx-complete problems. (English) Zbl 0998.90525 Inf. Process. Lett. 58, No. 3, 105-110 (1996). MSC: 90C27 68Q25 PDFBibTeX XMLCite \textit{V. Kann} et al., Inf. Process. Lett. 58, No. 3, 105--110 (1996; Zbl 0998.90525) Full Text: DOI