New approximation guarantee for chromatic number

@inproceedings{Arora2006NewAG,
  title={New approximation guarantee for chromatic number},
  author={Sanjeev Arora and Eden Chlamt{\'a}c},
  booktitle={STOC},
  year={2006}
}
We describe how to color every 3-colorable graph with O(n0.2111) colors, thus improving an algorithm of Blum and Karger from almost a decade ago. Our analysis uses new geometric ideas inspired by the recent work of Arora, Rao, and Vazirani on SPARSEST CUT, and these ideas show promise of leading to further improvements. 
Highly Cited
This paper has 88 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

89 Citations

051015'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…