Differential approximation of min sat

We present differential approximation results (both positive and negative) for optimal satisfiability, optimal constraint satisfaction, and some of the most popular restrictive versions of them. As an important corollary, we exhibit an interesting structural difference between the landscapes of approximability classes in standard and differential paradigms.

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

[2]  Roberto Battiti,et al.  Approximate Algorithms and Heuristics for MAX-SAT , 1998 .

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

[4]  Mauricio G. C. Resende,et al.  Computational experience with an interior point algorithm on the satisfiability problem , 1990, IPCO.

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

[6]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

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

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

[9]  J. Hooker.  Resolution vs. cutting plane solution of inference problems: Some computational experience , 1988 .

[10]  Lars Engebretsen.  Approximate constraint satisfaction , 2000 .

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

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

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

[14]  Vangelis Th. Paschos,et al.  Differential approximation for optimal satisfiability and related problems , 2003, Eur. J. Oper. Res..

[15]  Vangelis Th. Paschos,et al.  Approximation polynomiale des problèmes NP-difficiles - Optima locaux et rapport différentiel , 2003 .

[16]  Takao Asano,et al.  A Theoretical Framework of Hybrid Approaches to MAX SAT , 1997, ISAAC.

[17]  Dimitris Bertsimas,et al.  On Dependent Randomized Rounding Algorithms , 1996, IPCO.