Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time

The independence number of a graph and its chromatic number are hard to approximate. It is known that, unless coRP = NP, there is no polynomial time algorithm which approximates any of these quantities within a factor of n1-Ɛ for graphs on n vertices. We show that the situation is significantly better for the average case. For every edge probability p = p(n) in the range n-1/2+Ɛ ≤ p ≤ 3/4, we present an approximation algorithm for the independence number of graphs on n vertices, whose approximation ratio is O((np)1/2/log n) and whose expected running time over the probability space G(n,p) is polynomial. An algorithm with similar features is described also for the chromatic number. A key ingredient in the analysis of both algorithms is a new large deviation inequality for eigenvalues of random matrices, obtained through an application of Talagrand's inequality.

[1]  U. Feige,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000 .

[2]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..

[3]  Hans Jürgen Prömel,et al.  Coloring Clique-free Graphs in Linear Expected Time , 1992, Random Struct. Algorithms.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Noga Alon,et al.  Finding a large hidden clique in a random graph , 1998, SODA '98.

[6]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[7]  Tomasz Luczak.  The chromatic number of random graphs , 1991, Comb..

[8]  Noga Alon,et al.  Spectral Techniques in Graph Algorithms , 1998, LATIN.

[9]  Noga Alon,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1997, SIAM J. Comput..

[10]  Michel Talagrand.  A new isoperimetric inequality for product measure and the tails of sums of independent random variables , 1991 .

[11]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

[12]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[13]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[14]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[15]  C. R. Subramanian,et al.  Coloring Random Graphs in Polynomial Expected Time , 1993, ISAAC.

[16]  Noga Alon,et al.  A spectral technique for coloring random 3-colorable graphs (preliminary version) , 1994, STOC '94.

[17]  Béla Bollobás,et al.  The chromatic number of random graphs , 1988, Comb..

[18]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[20]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[21]  Ludek Kucera,et al.  The Greedy Coloring Is a Bad Probabilistic Algorithm , 1991, J. Algorithms.