On the hardness of approximating minimization problems

We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering and other related minimization problems. Specifically, there is an e > 0 such that Graph Coloring cannot be approximated with ratio n e unless P = NP. Set Covering cannot be approximated with ratio c log n for any c < 1/4 unless NP is contained in DTIME(n poly log n ). Similar results follow for related problems such as Clique Cover, Fractional Chromatic Number, Dominating Set, and others

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

[2]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[3]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[4]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[5]  Chak-Kuen Wong,et al.  Covering edges by cliques with regard to keyword conflicts and intersection graphs , 1978, CACM.

[6]  Mihalis Yannakakis,et al.  The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems , 1979, JACM.

[7]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

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

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

[10]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[11]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[12]  L. Wolsey,et al.  On the greedy heuristic for continuous covering and packing problems , 1982 .

[13]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

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

[15]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, STACS.

[16]  Nathan Linial,et al.  Graph products and chromatic numbers , 1989, 30th Annual Symposium on Foundations of Computer Science.

[17]  Avrim Blum,et al.  Some tools for approximate 3-coloring , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[19]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Phokion G. Kolaitis,et al.  Approximation properties of NP minimization classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

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

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

[23]  Adi Shamir,et al.  Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[25]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

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

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

[28]  M. Halldórsson.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Inf. Process. Lett..

[29]  Mihir Bellare,et al.  Interactive proofs and approximation: reductions from two provers in one round , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[30]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[31]  Carsten Lund,et al.  Efficient probabilistic checkable proofs and applications to approximation , 1994, STOC '94.

[32]  Mihir Bellare,et al.  The complexity of approximating a nonlinear program , 1995, Math. Program..