论文信息 - New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems

New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems

We investigate the relationship beetween the classes MAX-NP and GLO by studying the Maximum Generalized Satisfiability problem, which is in the former class. We present a (2−B)-approximate greedy heuristic for this problem and show that no local search c-approximate algorithm exists, based on an h-bounded neighborhood and on the number of satisfied clauses as objective function. This implies that, with the standard definition of local search, MAX-NP is not contained in GLO.

Paola Alimonti

[1] Mihalis Yannakakis,et al. On the approximation of maximum satisfiability , 1992, SODA '92.

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

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

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

[5] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

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