TY - GEN
T1 - Almost 2-SAT is fixed-parameter tractable (extended abstract)
AU - Razgon, Igor
AU - O'Sullivan, Barry
PY - 2008/8/14
Y1 - 2008/8/14
N2 - 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(15k *k*m3) time showing that this problem is fixed-parameter tractable.
AB - 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(15k *k*m3) time showing that this problem is fixed-parameter tractable.
UR - http://www.scopus.com/inward/record.url?scp=49049092826&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-70575-8_45
DO - 10.1007/978-3-540-70575-8_45
M3 - Conference contribution
AN - SCOPUS:49049092826
SN - 3540705740
SN - 9783540705741
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 551
EP - 562
BT - Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings
T2 - 35th International Colloquium on Automata, Languages and Programming, ICALP 2008
Y2 - 7 July 2008 through 11 July 2008
ER -