Tight bound on Johnson's algorithm for maximum satisfiability

Journal of Computer and System Sciences

Volumn 58, Issue 3, 1999, Pages 622-640

  Chen, Jianer ^a   Friesen, Donald K ^a   Zheng, Hao ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b Mfg Technologies Directorate   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; OPTIMIZATION; PROBABILITY; SET THEORY;

JOHNSON ALGORITHM; MAXIMUM SATISFIABILITY;

ALGORITHMS;

EID: 0032635721     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1612     Document Type: Article

References (13)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proc. 33rd IEEE Symposium on the Foundation of Computer Science, 1992," pp. 14-23.
2. U. Feige and M. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, in "Proc. 3rd Israel Symposium of Theory of Computing and Systems, 1995," pp. 182-189.
3. M. X. Goemans and D. P. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math. 7 (1994), 656-666.
4. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995), 1115-1145.
5. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990), 279-303.
6. J. Hastad, Some optimal inapproximability results, in "Proc. 28th Annual ACM Symposium on Theory of Computing, 1997," pp. 1-10.
7. D. S. Johnson, Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9 (1974), 256-278.
8. H. Karloff and U. Zwick, A 7/8-approximation algorithm for MAX-SAT?, in "Proc. 38th IEEE Symposium on the Foundation of Computer Science, 1997," pp. 406-415.
9. S. Khanna, R. Motwani, M. Sudan, and U. V. Vazirani, On syntactic versus computational views of approximability, in "Proc. 35th IEEE Symposium on the Foundation of Computer Science, 1994," pp. 819-830.
10. K. J. Lieberherr and E. Specker, Complexity of partial satisfaction, Journal of ACM 28 (1981), 411-421.
11. L. Trevisan, Approximating satisfiable satisfiability problems, in "Proc. 5th Annual European Symposium on Algorithms," Lecture Notes in Computer Science, Vol. 1284, pp. 472-485, 1997.
12. L. Trevisian, G. B. Sorkin, M. Sudan, and D. P. Williamson, Gadgets, approximation, and linear programming, in "Proc. 37th IEEE Symposium on the Foundation of Computer Science, 1996," pp. 617-626.
13. M. Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994), 475-502.