, Volume 70, Issue 1, pp 41–86 | Cite as

Polynomial Approximation and Graph-Coloring

  • V. Th. Paschos

Consider a graph G=(V,E) of order n. In the minimum graph-coloring problem we try to color V with as few colors as possible so that no two adjacent vertices receive the same color. This problem is among the first ones proved to be intractable, and hence, it is very unlikely that an optimal polynomial-time algorithm could ever be devised for it. In this paper, we survey the main polynomial time approximation algorithms (the ones for which theoretical approximability bounds have been studied) for the minimum graph-coloring and we discuss their approximation performance and their complexity. Finally, we further improve the approximation ratio for graph-coloring.

AMS Subject Classification: 05C15, 68Q17, 68Q25, 68W25, 90C59. 
Keywords: graph, coloring, complexity, NP-complete, approximation algorithm. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 2003

Authors and Affiliations

  • V. Th. Paschos
    • 1
  1. 1.LAMSADE, Université Paris-Dauphine Place du Maréchal de Lattre de Tassigny, 75775 (Cedex 16) Paris France e-mail: paschos@lamsade.dauphine.frFR

Personalised recommendations