Algorithmica

, Volume 5, Issue 1–4, pp 459–466

A better performance guarantee for approximate graph coloring

  • Bonnie Berger
  • John Rompel
Article

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 algorithms Graph coloring Performance guarantee 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [GJ]
    Garey, M. R., and Johnson, D. S., The complexity of near-optimal graph coloring,J. Assoc. Comput. Mach.,23 (1976), 43–49.MATHMathSciNetGoogle Scholar
  2. [J]
    Johnson, D. S., Worst-case behavior of graph-coloring algorithms,Proc. 5th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg, 1974, pp. 513–528.Google Scholar
  3. [LSW]
    Linial, N., Saks, M., and Wigderson, A., personal communication.Google Scholar
  4. [R]
    Raghavan, P., personal communication.Google Scholar
  5. [W]
    Wigderson, A., Improving the performance guarantee of approximate graph coloring,J. Assoc. Comput. Mach.,30 (1983), 729–735.MATHMathSciNetGoogle Scholar

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

Personalised recommendations