APPROX
2009
Springer
14 years 9 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...