Almost 2-SAT is Fixed-Parameter Tractable

We consider the following problem. Given a 2-cnf formula, is it possible to remove at most k clauses so that the resulting 2-cnf formula is satisfiable? This problem is known to different research communities in theoretical computer science under the names Almost 2-SAT, All-but-k 2-SAT, 2-cnf deletion, and 2-SAT deletion. The status of the fixed-parameter tractability of this problem is a long-standing open question in the area of parameterized complexity. We resolve this open question by proposing an algorithm that solves this problem in O(15^kxkxm^3) time showing that this problem is fixed-parameter tractable.

[1]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[2]  Georg Gottlob,et al.  Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..

[3]  Meena Mahajan,et al.  Parametrizing Above Guaranteed Values: MaxSat and MaxCut , 1997, Electron. Colloquium Comput. Complex..

[4]  Jianer Chen,et al.  Improved exact algorithms for MAX-SAT , 2002, Discret. Appl. Math..

[5]  Dániel Marx,et al.  Parameterized graph separation problems , 2004, Theor. Comput. Sci..

[6]  Martin Grohe,et al.  Parameterized Approximability of the Disjoint Cycle Problem , 2007, ICALP.

[7]  Saket Saurabh,et al.  The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number , 2007, ISAAC.

[8]  Falk Huner.  Algorithm Engineering for Optimal Graph Bipartization , 2009 .

[9]  Falk Hüffner,et al.  Algorithm Engineering for Optimal Graph Bipartization , 2005, J. Graph Algorithms Appl..

[10]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[11]  Jianer Chen,et al.  Improved exact algorithms for MAX-SAT , 2004, Discret. Appl. Math..

[12]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[13]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[14]  Rolf Niedermeier,et al.  Complexity and Exact Algorithms for Multicut , 2006, SOFSEM.

[15]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[17]  Jianer Chen,et al.  An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem , 2007, WADS.

[18]  Jianer Chen,et al.  An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem , 2007, Algorithmica.

[19]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..

[20]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[21]  Aleksandrs Slivkins,et al.  Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs , 2003, SIAM J. Discret. Math..

[22]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[23]  Barry O'Sullivan,et al.  Directed Feedback Vertex Set is Fixed-Parameter Tractable , 2007, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs.