On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
Information Processing Letters
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
Journal of Algorithms
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
63-Approximation Algorithm for MAX DICUT
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
Randomized greedy: new variants of some classic approximation algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Simpler 3/4-approximation algorithms for MAX SAT
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an approximation algorithm for MAX SAT with a conjectured performance guarantee of 0.8434. This improves on an approximation algorithm of Asano [Asa03] with a conjectured performance guarantee of 0.8353. We also obtain a 0.7968-approximation algorithm for MAX SAT which is not based on any conjecture, improving a 0.7877-approximation algorithm of Asano [Asa03].