## A still better performance guarantee for approximate graph coloring

Magnús M. Halldórsson

Science Institute, University of Iceland, IS-107 Reykjavik, Iceland.

We present an approximation algorithm for graph coloring which achieves a
performance guarantee of *O(n (loglog n)^2 /(log n)^3)*,
a factor of *log log n* improvement.