A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Karlo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semide nite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well with clauses of various sizes. We study the potential, and the limitations, of the relaxation and ofdoi:10.1007/3-540-48777-8_16 fatcat:cnqiu5eccrfftbke66q2iinhu4