Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses

Abstract We prove hardness results for approximating set splitting problems and also instances of satisfiability problems which have no “mixed” clauses, i.e., every clause has either all its literals unnegated or all of them negated. Results of Håstad imply tight hardness results for set splitting when all sets have size exactly $k \ge 4$ elements and also for non-mixed satisfiability problems with exactly $k$ literals in each clause for $k \ge 4$. We consider the case $k=3$. For the MAX E3-SET SPLITTING, problem in which all sets have size exactly 3, we prove an NP-hardness result for approximating within any factor better than ${\frac{19}{20}}$. This result holds even for satisfiable instances of MAX E3-SET SPLITTING, and is based on a PCP construction due to Håstad. For “non-mixed MAX 3SAT,” we give a PCP construction which is a slight variant of the one given by Håstad for MAX 3SAT, and use it to prove the NP-hardness of approximating within a factor better than ${\frac{11}{12}}$.

[1]  Jonas Holmerin Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - ε , 2002, STOC '02.

[2]  Venkatesan Guruswami Inapproximability results for set splitting and satisfiability problems with no mixed clauses , 2000, APPROX.

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

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

[5]  Alessandro Panconesi,et al.  Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems , 1996, Inf. Process. Lett..

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

[7]  David P. Williamson,et al.  A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction , 1997, STOC '97.

[8]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[9]  Uri Zwick,et al.  Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.

[10]  Erez Petrank The hardness of approximation: Gap location , 2005, computational complexity.

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

[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]  Luca Trevisan,et al.  Gadgets, approximation, and linear programming , 1996, Proceedings of 37th Conference on Foundations of Computer Science.