TY - JOUR
T1 - Approximating MIN 2-SAT and MIN 3-SAT
AU - Avidor, Adi
AU - Zwick, Uri
N1 - Funding Information:
∗ This research was supported by the Israel Science Foundation (Grant No. 246/01).
PY - 2005/5
Y1 - 2005/5
N2 - We 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.
AB - We 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.
UR - http://www.scopus.com/inward/record.url?scp=18244397179&partnerID=8YFLogxK
U2 - 10.1007/s00224-005-1140-7
DO - 10.1007/s00224-005-1140-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:18244397179
SN - 1432-4350
VL - 38
SP - 329
EP - 345
JO - Theory of Computing Systems
JF - Theory of Computing Systems
IS - 3
ER -