A short guide to approximation preserving reductions

Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to the definition of several approximation preserving reducibilities and to the development of powerful reduction techniques. We first review the main approximation preserving reducibilities that have appeared in the literature and suggest which one of them should be used. Successively, we give some hints on how to prove new non-approximability results by emphasizing the most interesting techniques among the new ones that have been developed in the last few years.

[1]  Prabhakar Raghavan.  Randomized Approximation Algorithms in Combinatorial Optimization , 1994, FSTTCS.

[2]  Luca Trevisan,et al.  MAX NP-Completeness Made Easy , 1997, Electron. Colloquium Comput. Complex..

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

[4]  Pierluigi Crescenzi,et al.  A Note on the Approximation of the MAX CLIQUE Problem , 1991, Inf. Process. Lett..

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

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

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

[8]  Paul Young,et al.  A Structural Overview of NP Optimization Problems , 1989, Optimal Algorithms.

[9]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducability and Its Applications , 1994, FSTTCS.

[10]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

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

[12]  Giorgio Ausiello,et al.  Lattice theoretic ordering properties for NP-complete optimization problems , 1981, Fundam. Informaticae.

[13]  Giorgio Ausiello,et al.  Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .

[14]  Daniel Pennac.  La fée carabine , 1987 .

[15]  David P. Williamson,et al.  New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..

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

[17]  Edoardo Amaldi,et al.  The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..

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

[19]  Lane A. Hemaspaandra.  Complexity theory column 5: the not-ready-for-prime-time conjectures , 1994, SIGA.

[20]  Luca Trevisan,et al.  To Weight or Not to Weight: Where is the Question? , 1996, ISTCS.

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

[22]  P WilliamsonDavid,et al.  New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem , 1994 .

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

[24]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[25]  Harry B. Hunt,et al.  Approximation Schemes Using L-Reductions , 1994, FSTTCS.

[26]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

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

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

[29]  Luca Trevisan,et al.  Structure in Approximation Classes (Extended Abstract) , 1995, International Computing and Combinatorics Conference.

[30]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[31]  Pierluigi Crescenzi,et al.  Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.

[32]  Luca Trevisan,et al.  Improved Non-approximability Results for Vertex Cover with Density Constraints , 1996, COCOON.

[33]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

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

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

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

[37]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[38]  José L. Balcázar,et al.  Structural complexity 1 , 1988 .

[39]  Phokion G. Kolaitis.  Hardness Of Approximations , 1996 .

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