1. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda;Ann. Discrete Math.,1985
2. An Õ(n0.4)-approximation algorithm for 3-coloring (and improved approximation algorithms for k-coloring);Blum,1989
3. New approximation algorithms for graph coloring;Blum;J. ACM,1994
4. Improved non-approximability results;Bellare,1994
5. On the hardness of approximating the chromatic number;Khanna,1992