APPROXIMATION ALGORITHMS FOR MAX SAT: A BETTER PERFORMANCE RATIO AT THE COST OF A LONGER RUNNING TIME

We describe approximation algorithms for (unweighted) MAX SAT with performance ratios arbitrarily close to 1 (in particular, when performance ratios exceed the limit of polynomialtime approximation). Namely, we show how to construct an ( + ")-approximation algorithm A from a given polynomial-time -approximation algorithmA0. The algorithmA runs in time of the order "(1 )

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

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

[3]  Carsten Lund,et al.  Hardness of approximations , 1996 .

[4]  Sanjeev Arora,et al.  Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[5]  Takao Asano,et al.  Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[6]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[7]  László Babai,et al.  Transparent Proofs and Limits to Approximation , 1994 .

[8]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Edward A. Hirsch,et al.  Two new upper bounds for SAT , 1998, SODA '98.

[10]  Ramesh Hariharan,et al.  Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[12]  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.

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

[14]  Uri Zwick,et al.  A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[15]  Oliver Kullmann.  Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms , 1997 .

[16]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[17]  Oliver Kullmann,et al.  Deciding propositional tautologies: Algorithms and their complexity , 1997 .

[18]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.