Simplified tight analysis of Johnson's algorithm

Authors:
Lars Engebretsen
Affiliations:
Department of Numerical Analysis and Computer Science, Royal Institute of Technology, SE-100 44 Stockholm, Sweden
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 0

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
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.