Tight bound on Johnson's algorithm for Max-SAT

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 274-281

  Chen, Jianer ^a   Friesen, D K ^a   Zheng, Hao ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAXIMUM SATISFIABILITY PROBLEMS; PERFORMANCE RATIO; TIGHT BOUND;

COMPUTATIONAL COMPLEXITY;

EID: 84999514868     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1997.612322     Document Type: Conference Paper

References (12)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, Proc. 33rd IEEE Symposium on the Foundation of Computer Science, pp. 14-23, (1992).
2. J. CHEN, D. K. FRIESEN, AND H. ZHENG, Tight bound on Johnson's algorithm for Maximum Satisfiability, Tech. Report, Dept. Computer Science, Texas A&M University, (1996).
3. U. FEICE AND M. GOEMANS, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proc. 3rd Israel Symposium of Theory of Computing and Systems, pp. 182-189, (1995).
4. M. X. GOEMANS AND D. P. WILLIAMSON, New |-approximation algorithms for the maximum satisfiability problem, SI AM Journal on Discrete Mathematics 7, pp. 656-666, (1994).
5. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, Journal of ACM 42, pp. 1115-1145, (1995).
6. P. HANSEN AND B. JAUMARD, Algorithms for the maximum satisfiability problem, Computing 44, pp. 279303, (1990).
7. D. S. JOHNSON, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9, pp. 256-278, (1974).
8. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. V. VAZI-RANI, On syntactic versus computational views of ap-proximability, Proc. 35th IEEE Symposium on the Foundation of Computer Science, pp. 819-830, (1994).
9. K. J. Lieberherr AND E. SPECKER, Complexity of partial satisfaction, Journal of ACM 28, pp. 411-421, (1981).
10. S. MAHAJAN AND H. RAMESH, Derandomizing semidefinite programming based approximation algorithms, Proc. 34th IEEE Symposium on the Foundation of Computer Science, pp. 162-169, (1995).
11. L. TREVISAN, G. B. SORKIN, M. SUDAN, AND D. P. WILLIAMSON, Gadgets, approximation, and linear programming, Proc. 37th IEEE Symposium on the Foundation of Computer Science, (1996), to appear.
12. M. YANNAKAKIS, On the approximation of maximum satisfiability, Journal of Algorithms 17, pp. 475-502, (1994).