Algorithmica

, Volume 5, Issue 1, pp 459–466

A better performance guarantee for approximate graph coloring

  • Bonnie Berger
  • John Rompel
Article

DOI: 10.1007/BF01840398

Cite this article as:
Berger, B. & Rompel, J. Algorithmica (1990) 5: 459. doi:10.1007/BF01840398

Abstract

Approximate graph coloring takes as input a graph and returns a legal coloring which is not necessarily optimal. We improve the performance guarantee, or worst-case ratio between the number of colors used and the minimum number of colors possible, toO(n(log logn)3/(logn)3), anO(logn/log logn) factor better than the previous best-known result.

Key words

Approximation algorithmsGraph coloringPerformance guarantee

Copyright information

© Springer-Verlag New York Inc. 1990

Authors and Affiliations

  • Bonnie Berger
    • 1
  • John Rompel
    • 1
  1. 1.Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridgeUSA