Approximating maximum independent set in bounded degree graphs

For every A > 2 and E > 0 we present a polynomial time approximation algorithm for the Maximum Independent Set problem, that in a graph of degree A approximates an optimal solution within ratio & E for even A and within ratio & E for odd A.

[1]  L. Lovász.  Three short proofs in graph theory , 1975 .

[2]  Ravi B. Boppana,et al.  Approximating maximum independent sets by excluding subgraphs , 1990, BIT.

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

[4]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..

[5]  Vangelis Th. Paschos.  A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem , 1992, Inf. Process. Lett..

[6]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[7]  Jaikumar Radhakrishnan,et al.  The relative size of greedy independent sets in sparse and bounded-degree graphs , 1994 .

[8]  M. Bellare,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.

[9]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[10]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[11]  Ewald Speckenmeyer,et al.  Some Further Approximation Algorithms for the Vertex Cover Problem , 1983, CAAP.

[12]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[13]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.