Tight Bound on Johnson's Algoritihm for Max-SAT

Authors:
Jianer Chen;Donald K. Friesen;Hao Zheng
Affiliations:
-;-;-
Venue:
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Year:
1997

Citing 11
Cited 4

Algorithms for the maximum satisfiability problem

Computing
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
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Complexity of Partial Satisfaction

Journal of the ACM (JACM)
Derandomizing semidefinite programming based approximation algorithms

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Gadgets Approximation, and Linear Programming

FOCS '96 Proceedings of the 37th 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)
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On syntactic versus computational views of approximability

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Towards Automatic Creation of Realistic Anthropomorphic Models for Realtime 3D Telecommunication

Journal of VLSI Signal Processing Systems - special issue on multimedia signal processing
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
GRASP with path-relinking for the weighted maximum satisfiability problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new technique that gives a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1/2, we show that the performance ratio is 2/3, and that this bound is tight. Moreover, we show that simple generalizations of Johnson's algorithm do not improve the performance ratio bound 2/3.Keywords. optimization, approximation algorithm, performance ratio, maximum satisfiability