A new approximate graph coloring algorithm

Avi Wigderson*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Let A be a graph coloring algorithm. Denote by Â(G) the ratio between the maximum number of colors A will use to color the graph C, and the chromatic number of G, χ(G). For most existing polynomial coloring algorithms, Â(G) can be as bad as O(n), where n is the number of vertices in G. The best currently known algorithm guarantees Â(G)-O(n/log n). In this paper we present a simple and efficient coloring algorithm which guarantees Â(G)≤χ(G)n1-1/χ(G)-1, a considerable improvement over the current bounds.

Original languageEnglish
Title of host publicationProceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982
PublisherAssociation for Computing Machinery
Pages325-329
Number of pages5
ISBN (Print)0897910702
DOIs
StatePublished - 5 May 1982
Externally publishedYes
Event14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States
Duration: 5 May 19827 May 1982

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference14th Annual ACM Symposium on Theory of Computing, STOC 1982
Country/TerritoryUnited States
CitySan Francisco
Period5/05/827/05/82

Bibliographical note

Publisher Copyright:
© 1982 ACM.

Fingerprint

Dive into the research topics of 'A new approximate graph coloring algorithm'. Together they form a unique fingerprint.

Cite this