An improved algorithm for approximating the chromatic number of Gn,p

Authors:
Amin Coja-Oghlan;Lars Kuhtz
Affiliations:
Humboldt-Universität zu Berlin, Institut für Informatik, Berlin, Germany;Universität des Saarlandes, FR Informatik, Saarbrücken, Germany
Venue:
Information Processing Letters
Year:
2006

Citing 7
Cited 0

The greedy coloring is a bad probabilistic algorithm

Journal of Algorithms
Algorithmic theory of random graphs

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Exact and approximative algorithms for coloring G(n,p)

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
The Lovász Number of Random Graphs

Combinatorics, Probability and Computing
MAX k-CUT and approximating the chromatic number of random graphs

Random Structures & Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

Answering a question of Krivelevich and Vu [M. Krivelevich, V.H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J. Combin. Optimization 6 (2002) 143-155], we present an algorithm for approximating the chromatic number of random graphs Gn, p within a factor of O(√np/ln(np)) in polynomial expected time. The algorithm applies to edge probabilities c0/n ≤ p ≤ 0.99, where c0 0 is a certain constant.