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
Tight bound on Johnson's algorithm for maximum satisfiability
Journal of Computer and System Sciences
Some optimal inapproximability results
Journal of the ACM (JACM)
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
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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)
Simplified tight analysis of Johnson's algorithm
Information Processing Letters
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
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
Simpler 3/4-approximation algorithms for MAX SAT
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
We give a randomized variant of Johnson's algorithm for MAX SAT [12] and show that its expected approximation ratio is 3/4. Our solution also works in an online setting where variables are revealed one by one together with the clauses they appear in. Our simple algorithm does not use the power of linear programming and, to the best of our knowledge, is the first such algorithm to reach approximation ratio 3/4. We also investigate a variant of Johnson's algorithm proposed in [5] that processes variables in random order. Here we show that the expected approximation ratio is worse than 3/4, thus providing a partial answer to a question of [5].