Theoretical Computer Science Approximate Solution of Np Optimization Problems *

Abstract This paper presents the main results obtained in the field of approximation algorithms in a unified framework. Most of these results have been revisited in order to emphasize two basic tools useful for characterizing approximation classes, that is, combinatorial properties of problems and approximation preserving reducibilities. In particular, after reviewing the most important combinatorial characterizations of the classes PTAS and FPTAS, we concentrate on the class APX and, as a concluding result, we show that this class coincides with the class of optimization problems which are reducible to the maximum satisfiability problem with respect to a polynomial-time approximation preserving reducibility.

[1]  Harry Buhrman,et al.  On the structure of complete sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[2]  Joan Feigenbaum,et al.  Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions , 1993, STOC.

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

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

[5]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

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

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

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

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

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

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

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

[13]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[14]  Pierluigi Crescenzi,et al.  Average Measure, Descriptive Complexity and Approximation of Maximization Problems , 1993, Int. J. Found. Comput. Sci..

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

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

[17]  Tao Jiang,et al.  Linear approximation of shortest superstrings , 1991, STOC '91.

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

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

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

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

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

[23]  Alberto Marchetti-Spaccamela,et al.  On Different Approximation Criteria for Subset Product Problems , 1985, Inf. Process. Lett..

[24]  Erich Grädel,et al.  Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions , 1992, CSL.

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

[26]  Giorgio Ausiello,et al.  Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..

[27]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

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

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

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

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

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

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

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

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

[36]  Franklin A. Graybill,et al.  Introduction to The theory , 1974 .

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

[38]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[39]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[40]  Rainer Schrader,et al.  ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES , 1981 .

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

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

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

[44]  Viggo Kann,et al.  On the Approximability of the Maximum Common Subgraph Problem , 1992, STACS.

[45]  Pierluigi Crescenzi,et al.  Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems , 1990, Inf. Process. Lett..

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

[47]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .