Venkatesan Guruswami, Ali Kemal Sinop. Improved Inapproximability Results for Maximum k-Colorable Subgraph. In Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Volume 5687 of Lecture Notes in Computer Science, pages 163-176, Springer, 2009. [doi]
Abstract is missing.