Approximating MIN 2-SAT and MIN 3-SAT

AbstractWe obtain substantially improved approximation algorithms for the MIN k-SAT problem, for k = 2,3. More specifically, we obtain a 1.1037-approximation algorithm for the MIN 2-SAT problem, improving a previous 1.5-approximation algorithm, and a 1.2136-approximation algorithm for the MIN 3-SAT problem, improving a previous 1.75-approximation algorithm for the problem. These results are obtained by adapting techniques that were previously used to obtain approximation algorithms for the MAX k-SAT problem. We also obtain some hardness of approximation results.

[1]  Dorit S. Hochbaum.  Instant recognition of polynominal time solvability, half integrality and 2-approximations , 2000, APPROX.

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

[3]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

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

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

[6]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[7]  Madhav V. Marathe,et al.  On Approximation Algorithms for the Minimum Satisfiability Problem , 1996, Inf. Process. Lett..

[8]  Eran Halperin,et al.  Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.

[9]  Reuven Bar-Yehuda,et al.  A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.

[10]  Uri Zwick,et al.  Computer assisted proof of optimal approximability results , 2002, SODA '02.

[11]  Sanjeev Mahajan,et al.  Derandomizing Approximation Algorithms Based on Semidefinite Programming , 1999, SIAM J. Comput..

[12]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results (Extended Abstract) , 1999, ICALP.

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

[14]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[15]  Piotr Berman,et al.  On Approximation Properties of the Independent Set Problem for Low Degree Graphs , 1999, Theory of Computing Systems.

[16]  Dorit S. Hochbaum,et al.  Approximating a generalization of MAX 2SAT and MIN 2SAT , 2000, Discret. Appl. Math..

[17]  Rajeev Kohli,et al.  The Minimum Satisfiability Problem , 1994, SIAM J. Discret. Math..

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

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

[20]  Marek Karpinski,et al.  Polynomial time approximation schemes for dense instances of minimum constraint satisfaction , 2003, Random Struct. Algorithms.

[21]  Tomomi Matsui,et al.  63-Approximation Algorithm for MAX DICUT , 2001, RANDOM-APPROX.

[22]  Reuven Bar-Yehuda,et al.  A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

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

[24]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

[25]  Wu-Yi Hsiang,et al.  ON INFINITESIMAL SYMMETRIZATION AND VOLUME FORMULA FOR SPHERICAL OR HYPERBOLIC TETRAHEDRONS , 1988 .

[26]  Matsui Tomomi,et al.  0.935 - Approximation Randomized Algorithm for MAX 2SAT and Its Derandomization , 2001 .

[27]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..