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
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Models of Greedy Algorithms for Graph Problems
Algorithmica
Priority algorithms for graph optimization problems
Theoretical Computer Science
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Randomized priority algorithms
Theoretical Computer Science
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
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online 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
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on 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 study adaptive priority algorithms for MAX SAT and show that no such deterministic algorithm can reach approximation ratio 3/4, assuming an appropriate model of data items. As a consequence we obtain that the Slack-Algorithm of [13] cannot be derandomized. Moreover, we present a significantly simpler version of the Slack-Algorithm and also simplify its analysis. Additionally, we show that the algorithm achieves a ratio of 3/4 even if we compare its score with the optimal fractional score.