An O(n0.4)-approximation algorithm for 3-coloring

Authors:
A. Blum
Affiliations:
MIT Laboratory for Computer Science, Cambridge, MA
Venue:
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Year:
1989

Citing 2
Cited 5

Improving the performance guarantee for approximate graph coloring

Journal of the ACM (JACM)
Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica

Crytographic limitations on learning Boolean formulae and finite automata

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Original Contribution: Training a 3-node neural network is NP-complete

Neural Networks
Cryptographic limitations on learning Boolean formulae and finite automata

Journal of the ACM (JACM)
New approximation algorithms for graph coloring

Journal of the ACM (JACM)
Graph Coloring with Adaptive Evolutionary Algorithms

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a polynomial-time algorithm to color any 3-colorable n-node graph with O(n2/5 log8/5 n) colors, improving the best previously known bound of O(√n/√logn) colors. By reducing the number of colors needed to color a 3-colorable graph, the algorithm also improves the bound for k-coloring for fixed k ≥ 3 from the previous O((n/log n)1-1/(k-1)) colors to O(n1-1/(k-4/3) log8/5 n) colors. An extension of the algorithm further improves the bounds. Precise values appear in a table at the end of this paper.