Elsevier

Discrete Applied Mathematics

Volume 155, Issue 2, 15 January 2007, Pages 172-179
Discrete Applied Mathematics

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover

https://doi.org/10.1016/j.dam.2006.04.039Get rights and content
Under an Elsevier user license
open archive

Abstract

The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al. [Constraint satisfaction: the approximability of minimization problems, Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24–27 June, 1997, pp. 282–296], and its approximability is largely open. We prove a lower approximation bound of 85-152.88854, improving the previous bound of 105-211.36067 by Dinur and Safra [The importance of being biased, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), May 2002, pp. 33–42, also ECCC Report TR01-104, 2001]. For highly restricted instances with exactly four occurrences of every variable we provide a lower bound of 32. Both inapproximability results apply to instances with no mixed clauses (the literals in every clause are both either negated, or unnegated).

We further prove that any k-approximation algorithm for the MINIMUM 2SAT-DELETION problem polynomially reduces to a (2-2/(k+1))-approximation algorithm for the MINIMUM VERTEX COVER problem.

One ingredient of these improvements is our proof that the MINIMUM VERTEX COVER problem is hardest to approximate on graphs with perfect matching. More precisely, the problem to design a ρ-approximation algorithm for the MINIMUM VERTEX COVER on general graphs polynomially reduces to the same problem on graphs with perfect matching. This improves also on the results by Chen and Kanj [On approximating minimum vertex cover for graphs with perfect matching, Proceedings of the 11st ISAAC, Taipei, Taiwan, Lecture Notes in Computer Science, vol. 1969, Springer, Berlin, 2000, pp. 132–143].

Keywords

Approximation hardness
2SAT-Deletion
Vertex cover

Cited by (0)

A preliminary version of this paper (M. Chlebík, J. Chlebíková: On approximation hardness of the Minimum 2SAT-DELETION problem) was published in Proceedings of 29th Mathematical Foundations of Computer Science (MFCS) 2004, Prague, Czech Republic, August 22–27, 2004, Lecture Notes in Computer Science, vol. 3153, pp. 263–273, (J. Fiala et al., Eds.), ©Springer, Berlin, Heidelberg, 2004. With kind permission of Springer Science and Business Media.