On syntactic versus computational views of approximability

We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is well understood. Our results provide a syntactic characterization of computational classes and give a computational framework for syntactic classes. We compare the syntactically defined class MAX SNP with the computationally defined class APX and show that every problem in APX can be "placed" (i.e., has approximation-preserving reduction to a problem) in MAX SNP. Our methods introduce a simple, yet general, technique for creating approximation-preserving reductions which shows that any "well"-approximable problem can be reduced in an approximation-preserving manner to a problem which is hard to approximate to corresponding factors. The reduction then follows easily from the recent nonapproximability results for MAX SNP-hard problems. We demonstrate the generality of this technique by applying it to other classes such as MAX SNP-RMAX(2) and MIN F$^{+}\Pi_2(1)$ which have the clique problem and the set cover problem, respectively, as complete problems. The syntactic nature of MAX SNP was used by Papadimitriou and Yannakakis [J. Comput. System Sci., 43 (1991), pp. 425--440] to provide approximation algorithms for every problem in the class. We provide an alternate approach to demonstrating this result using the syntactic nature of MAX SNP. We develop a general paradigm, nonoblivious local search, useful for developing simple yet efficient approximation algorithms. We show that such algorithms can find good approximations for all MAX SNP problems, yielding approximation ratios comparable to the best known for a variety of specific MAX SNP-hard problems. Nonoblivious local search provably outperforms standard local search in both the degree of approximation achieved and the efficiency of the resulting algorithms.

[1]  Phokion G. Kolaitis,et al.  Approximation Properties of NP Minimization Classes , 1995, J. Comput. Syst. Sci..

[2]  Jaikumar Radhakrishnan,et al.  Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal , 1994, Nord. J. Comput..

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

[4]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

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

[6]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducibility and Its Applications , 2000, Theory Comput. Syst..

[7]  Giorgio Ausiello,et al.  Approximate Solution of NP Optimization Problems , 1995, Theor. Comput. Sci..

[8]  Mihalis Yannakakis,et al.  The Analysis of Local Search Problems and Their Heuristics , 1990, Symposium on Theoretical Aspects of Computer Science.

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

[10]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[11]  Jerry Avorn Technology , 1929, Nature.

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

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

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

[15]  Paola Alimonti New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.

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

[17]  Piotr Berman,et al.  Approximating maximum independent set in bounded degree graphs , 1994, SODA '94.

[18]  Desh Ranjan,et al.  Quantifiers and approximation , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

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

[20]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

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

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

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

[24]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..