On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Tight bound on Johnson's algorithm for maximum satisfiability
Journal of Computer and System Sciences
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
Hi-index | 0.89 |
In their paper "Tight bound on Johnson's algorithm for maximum satisfiability" [J. Comput. System Sci. 58 (3) (1999) 622-640] Chen, Friesen and Zheng provided a tight bound on the approximation ratio of Johnson's algorithm for Maximum Satisfiability [J. Comput. System Sci. 9 (3) (1974) 256-278]. We give a simplified proof of their result and investigate to what extent it may be generalized to non-Boolean domains.