Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Note on the independence number of triangle-free graphs, II
Journal of Combinatorial Theory Series A
Algorithms for approximate graph coloring
Algorithms for approximate graph coloring
A still better performance guarantee for approximate graph coloring
Information Processing Letters
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
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
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Theoretical Computer Science
An Õ(n3/14)-coloring algorithm for 3-colorable graphs
Information Processing Letters
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Differential approximation algorithms for some combinatorial optimization problems
Theoretical Computer Science
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Master-Slave Strategy and Polynomial Approximation
Computational Optimization and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Derandomizing semidefinite programming based approximation algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Graphs and Hypergraphs
Combinatorial optimization in system configuration design
Automation and Remote Control
Representing uncertain data: models, properties, and algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Survey: A survey on the structure of approximation classes
Computer Science Review
| Hi-index | 0.00 |
Consider a graph G = (V,E) of order n. In the minimum graph-coloring problem we try to color V with as few colors as possible so that no two adjacent vertices receive the same color. This problem is among the first ones proved to be intractable, and hence, it is very unlikely that an optimal polynomial-time algorithm could ever be devised for it. In this paper, we survey the main polynomial time approximation algorithms (the ones for which theoretical approximability bounds have been studied) for the minimum graph-coloring and we discuss their approximation performance and their complexity. Finally, we further improve the approximation ratio for graph-coloring.