Approximating the independence number via theϑ-function

AbstractWe describe an approximation algorithm for the independence number of a graph. If a graph onn vertices has an independence numbern/k + m for some fixed integerk ⩾ 3 and somem > 0, the algorithm finds, in random polynomial time, an independent set of size $$\tilde \Omega (m^{{3 \mathord{\left/ {\vphantom {3 {(k + 1)}}} \right. \kern-\nulldelimiterspace} {(k + 1)}}} )$$ , improving the best known previous algorithm of Boppana and Halldorsson that finds an independent set of size Ω(m1/(k−1)) in such a graph. The algorithm is based on semi-definite programming, some properties of the Lovászϑ-function of a graph and the recent algorithm of Karger, Motwani and Sudan for approximating the chromatic number of a graph. If theϑ-function of ann vertex graph is at leastMn1−2/k for some absolute constantM, we describe another, related, efficient algorithm that finds an independent set of sizek. Several examples show the limitations of the approach and the analysis together with some related arguments supply new results on the problem of estimating the largest possible ratio between theϑ-function and the independence number of a graph onn vertices. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

[1]  B. S. Kashin,et al.  On systems of vectors in a Hilbert space , 1981 .

[2]  László Lovász,et al.  Approximating clique is almost NP-complete , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[3]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[4]  Noga Alon,et al.  A note on euclidean Ramsey theory and a construction of Bourgain , 1991 .

[5]  Noga Alon,et al.  Explicit Ramsey graphs and orthonormal labelings , 1994, Electron. J. Comb..

[6]  S. Konyagin.  Systems of vectors in Euclidean space and an extremal problem for polynomials , 1981 .

[7]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[8]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Magnús M. Halldórsson,et al.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.

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

[11]  J. Håstad.  Clique is hard to approximate within n 1-C , 1996 .

[12]  P. Erdős.  Some remarks on chromatic graphs , 1967 .

[13]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[14]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

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

[16]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[17]  Uriel Feige,et al.  Randomized graph products, chromatic numbers, and Lovasz j-function , 1995, STOC '95.

[18]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[19]  Lars Engebretsen,et al.  Clique Is Hard To Approximate Within , 2000 .

[20]  Gene H. Golub,et al.  Matrix computations , 1983 .

[21]  Carsten Lund,et al.  Proof verification and the intractability of approximation problems , 1992, FOCS 1992.

[22]  Mario Szegedy.  A note on the /spl theta/ number of Lovasz and the generalized Delsarte bound , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

[24]  AroraSanjeev,et al.  Probabilistic checking of proofs , 1998 .

[25]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.