Inapproximability of Combinatorial Optimization Problems

We survey results on the hardness of approximating combinatorial optimization problems.

[1]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[2]  Madhu Sudan,et al.  Some improvements to total degree tests , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[3]  Kenneth J. Giuliani.  Factoring Polynomials with Rational Coeecients , 1998 .

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

[5]  Daniele Micciancio,et al.  Stronger average case to worst case connections , 2004 .

[6]  Ravi Kumar,et al.  A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.

[7]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[8]  Sudipto Guha,et al.  Asymmetric k-center is log* n-hard to approximate , 2005, JACM.

[9]  Jacques Stern,et al.  The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..

[10]  Subhash Khot,et al.  Hardness of approximating the shortest vector problem in high L/sub p/ norms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[12]  Luca Trevisan,et al.  Gowers uniformity, influence of variables, and PCPs , 2005, STOC '06.

[13]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[14]  Phokion G. Kolaitis,et al.  Logical Definability of NP Optimization Problems , 1994, Inf. Comput..

[15]  Aaron Archer,et al.  Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem , 2001, IPCO.

[16]  Madhu Sudan,et al.  Small PCPs with low query complexity , 2000, computational complexity.

[17]  Irit Dinur,et al.  Approximating SVPinfinity to within almost-polynomial factors is NP-hard , 1998, Theor. Comput. Sci..

[18]  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.

[19]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[20]  Daniele Micciancio,et al.  Worst-case to average-case reductions based on Gaussian measures , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[21]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[22]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[23]  Sanjeev Arora.  Probabilistic checking of proofs and hardness of approximation problems , 1995 .

[24]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

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

[26]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[27]  Madhu Sudan,et al.  Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.

[28]  Viggo Kann,et al.  Polynomially Bounded Minimization Problems That Are Hard to Approximate , 1993, Nord. J. Comput..

[29]  M. Murty.  Ramanujan Graphs , 1965 .

[30]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[31]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[32]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[33]  William I. Gasarch,et al.  On bounded queries and approximation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

[35]  Subhash Khot,et al.  Hardness results for coloring 3-colorable 3-uniform hypergraphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[36]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[37]  Nicos Christofides,et al.  Hamiltonian Circuits and the Travelling Salesman Problem , 1975 .

[38]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[39]  Dorit Aharonov,et al.  Lattice problems in NP ∩ coNP , 2005, JACM.

[40]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[42]  Alessandro Panconesi,et al.  Completeness in Approximation Classes , 1989, Inf. Comput..

[43]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[44]  Luca Trevisan,et al.  Structure in Approximation Classes , 1999, Electron. Colloquium Comput. Complex..

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

[46]  Subhash Khot.  Hardness of approximating the Shortest Vector Problem in high lp norms , 2006, J. Comput. Syst. Sci..

[47]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[48]  Noga Alon,et al.  Approximating the independence number via theϑ-function , 1998, Math. Program..

[49]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[50]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[51]  SudanMadhu,et al.  Approximate graph coloring by semidefinite programming , 1998 .

[52]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[53]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

[55]  Béla Bollobás,et al.  Proving integrality gaps without knowing the linear program , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[56]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[57]  Uriel Feige,et al.  Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..

[58]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[59]  Anne Condon.  The complexity of the max word problem and the power of one-way interactive proof systems , 2005, computational complexity.

[60]  Irit Dinur.  Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard , 2000, CIAC.

[61]  C. P. Schnorr,et al.  A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..

[62]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

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

[64]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[65]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[66]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[67]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

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

[69]  Nisheeth K. Vishnoi,et al.  Integrality gaps for sparsest cut and minimum linear arrangement problems , 2006, STOC '06.

[70]  Ryan O'Donnell,et al.  SDP gaps and UGC-hardness for MAXCUTGAIN , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[71]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[72]  Uriel Feige,et al.  Approximation thresholds for combinatorial optimization problems , 2003, ArXiv.

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

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

[75]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[76]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[77]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[78]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[79]  Luca Trevisan,et al.  The Approximability of Constraint Satisfaction Problems , 2001, SIAM J. Comput..

[80]  Subhash Khot.  Guest column: inapproximability results via Long Code based PCPs , 2005, SIGA.

[81]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[82]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[83]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[84]  Subhash Khot,et al.  Hardness of approximating the shortest vector problem in lattices , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[85]  P. Orponen,et al.  On Approximation Preserving Reductions: Complete Problems and Robust Measures (Revised Version) , 1987 .

[86]  Rina Panigrahy,et al.  An O(log*n) approximation algorithm for the asymmetric p-center problem , 1996, SODA '96.

[87]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[88]  M. Bellare.  Proof Checking and Approximation: Towards Tight Results , 1996 .

[89]  Alan M. Frieze,et al.  On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.

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

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

[92]  Joseph Naor,et al.  New hardness results for congestion minimization and machine scheduling , 2004, STOC '04.

[93]  Irit Dinur,et al.  The Hardness of 3-Uniform Hypergraph Coloring , 2005, Comb..

[94]  Nadia Creignou,et al.  A Dichotomy Theorem for Maximum Generalized Satisfiability Problems , 1995, J. Comput. Syst. Sci..

[95]  Rajeev Motwani,et al.  On syntactic versus computational views of approximability , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[96]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

[97]  Richard Chang,et al.  On the query complexity of clique size and maximum satisfiability , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[98]  Sanjeev Arora,et al.  The approximability of NP-hard problems , 1998, STOC '98.

[99]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[100]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[101]  James R. Lee,et al.  Lp metrics on the Heisenberg group and the Goemans-Linial conjecture , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[102]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[103]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[104]  Uriel Feige,et al.  Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[105]  Eli Ben-Sasson,et al.  Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[106]  Nathan Linial,et al.  On the Hardness of Approximating the Chromatic Number , 2000, Comb..

[107]  Luca Trevisan,et al.  Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..

[108]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[109]  Cynthia Dwork,et al.  A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.

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

[111]  Eli Ben-Sasson,et al.  Robust pcps of proximity, shorter pcps and applications to coding , 2004, STOC '04.

[112]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[113]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2003, Random Struct. Algorithms.

[114]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[115]  Santosh S. Vempala,et al.  On The Approximability Of The Traveling Salesman Problem , 2006, Comb..

[116]  David R. Karger,et al.  An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs , 1997, Information Processing Letters.

[117]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

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

[119]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[120]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[121]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

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

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

[124]  Desh Ranjan,et al.  Quantifiers and approximation , 1990, STOC '90.

[125]  Zvi Galil,et al.  Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..

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

[127]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[128]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[129]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[130]  Subhash Khot,et al.  Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[131]  Guy Kindler,et al.  Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 2003, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[132]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[133]  Christos H. Papadimitriou,et al.  An approximation scheme for planar graph TSP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[134]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[135]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[136]  Klaus Ritter,et al.  A Decomposition Method for Structured Linear and Nonlinear Programs , 1969, J. Comput. Syst. Sci..

[137]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[138]  Yuval Rabani,et al.  On the Hardness of Approximating Multicut and Sparsest-Cut , 2005, Computational Complexity Conference.

[139]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[140]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[141]  Luca Trevisan,et al.  When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree , 2000, SIAM J. Comput..

[142]  Robert Krauthgamer,et al.  A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[143]  Sanjeev Arora,et al.  Reductions, codes, PCPs, and inapproximability , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

[145]  Eli Ben-Sasson,et al.  Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.

[146]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[147]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[148]  Luca Trevisan,et al.  When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract) , 1997, STOC '97.

[149]  Daniele Micciancio.  The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant , 2000, SIAM J. Comput..

[150]  Aravind Srinivasan,et al.  Integrality ratio for group Steiner trees and directed steiner trees , 2003, SODA '03.

[151]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[152]  Luca Trevisan,et al.  A PCP characterization of NP with optimal amortized query complexity , 2000, STOC '00.

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

[154]  Uriel Feige,et al.  On the optimality of the random hyperplane rounding technique for MAX CUT , 2002, Random Struct. Algorithms.

[155]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.