On the Complexity of Approximating the Independent Set Problem

We show that for some positive constant c it is not feasible to approximate Independent Set (for graphs of n nodes) within a factor of n c , provided Maximum 2-Satisfiability does not have a randomized polynomial time approximation scheme. We also study reductions preserving the quality of approximations and exhibit complete problems.

[1]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[2]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theor. Comput. Sci..

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

[4]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[5]  Shlomo Moran,et al.  Non Deterministic Polynomial Optimization Problems and their Approximations , 1977, Theoretical Computer Science.

[6]  Hans Ulrich Simon,et al.  On Approximate Solutions for Combinatorial Optimization Problems , 1990, SIAM J. Discret. Math..

[7]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[8]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness , 1984, EATCS Monographs on Theoretical Computer Science.

[9]  Giorgio Ausiello,et al.  Toward a Unified Approach for the Classification of NP-Complete Optimization Problems , 1979, Theor. Comput. Sci..

[10]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[12]  Giorgio Ausiello,et al.  On the Structure of Combinatorial Problems and Structure Preserving Reductions , 1977, ICALP.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Giorgio Ausiello,et al.  Structure Preserving Reductions among Convex Optimization Problems , 1980, J. Comput. Syst. Sci..

[15]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

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

[17]  Fred S. Roberts,et al.  Applied Combinatorics , 1984 .

[18]  Avi Wigderson,et al.  A new approximate graph coloring algorithm , 1982, STOC '82.

[19]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[20]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .