Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximation results for the minimum graph coloring problem
Information Processing Letters
Maximizing the number of unused colors in the vertex coloring problem
Information Processing Letters
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some tools for approximate 3-coloring
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The maximum saving partition problem
Operations Research Letters
| Hi-index | 0.07 |
The graph coloring problem is to color vertices of a graph so that no adjacent vertices are of the same color. The problem is difficult not only in finding the optimal solution, but also in approximation. Since it is hard to approximate the minimum number of colors, we consider to approximate the maximum number of unused colors. This approximation is based on saving colors with respect to the most naive coloring method, which colors each vertex with a different color. In this paper we propose a polynomial-time graph coloring algorithm with approximation ratio 3/4 for the maximum number of unused colors, which improves the previous result 2/3.