Approximating satisfiable satisfiability problems

Algorithmica (New York)

Volumn 28, Issue 1, 2000, Pages 145-172

  Trevisan, L ^a  

^a Columbia University ^*  (United States)

Author keywords

Approximation algorithms; Constraint satisfaction; Maximum satisfiability

Indexed keywords

EID: 0042418350     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010035     Document Type: Article

References (45)

1. T. Asano. Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. In Proceedings of the 5th IEEE Israel Symposium on Theory of Computing and Systems, pages 24-37, 1997.
2. G. Andersson and L. Engebretsen. Better approximation algorithms for Set Splitting and Not-All-Equal Sat. Information Processing Letters, 65(6):305-311, 1998.
3. T. Asano, T. Hirata, and T. Ono. Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3:388-404, 1996.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998. Preliminary version in Proc. FOCS '92.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998. Preliminary version in Proc. FOCS '92.
6. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122,1998. Preliminary version in Proc. FOCS '92.
7. S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122,1998. Preliminary version in Proc. FOCS '92.
8. L. Babai and P. Frankl. Linear Algebraic Methods in Combinatorics (2nd preliminary version). Monograph in preparation, 1992.
9. M Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 294-304, 1993. See also the errata sheet in Proc. STOC '94.
10. M Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 294-304, 1993. See also the errata sheet in Proc. STOC '94.
11. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCP's and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998. Preliminary version in Proc. FOCS '95.
12. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCP's and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998. Preliminary version in Proc. FOCS '95.
13. M. Bellare and M. Sudan. Improved non-approximability results. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 184-193, 1994.
14. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences, 51(3):511-522, 1995.
15. J. Chen, D. Friesen, and H. Zheng. Tight bound on Johnson's algorithm for MaxSAT. In Proceedings of the 12th IEEE Conference on Computational Complexity, pages 274-281, 1997.
16. P. Crescenzi and L. Trevisan. MAX NP-completeness made easy. Technical Report TR97-039, Electronic Colloquium on Computational Complexity, 1997.
17. U. Feige and M.X. Goemans. Approximating the value of two provers proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the 3rd IEEE Israel Symposium on Theory of Computing and Systems, pages 182-189, 1995.
18. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996. Preliminary version in Proc. FOCS '91.
19. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996. Preliminary version in Proc. FOCS '91.
20. U. Feige and J. Kilian. Two prover protocols - low error at affordable rates. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 172-183, 1994.
21. V. Guruswami, D. Lewin, M. Sudan, and L. Trevisan. A tight characterization of NP with 3 query PCPs. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, pages 8-17, 1998.
22. M.X. Goemans and D.P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(4):656-666, 1994. Preliminary version in Proc. IPCO '93.
23. M.X. Goemans and D.P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(4):656-666, 1994. Preliminary version in Proc. IPCO '93.
24. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995. Preliminary version in Proc. STOC '94.
25. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6):1115-1145, 1995. Preliminary version in Proc. STOC '94.
26. 1-ε. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 627-636, 1996.
27. J. Håstad. Testing of the long code and hardness for clique. In Proceedings of the 28th ACM Symposium on Theory of Computing, pages 11-19, 1996.
28. J. Håstad. Some optimal inapproximability results. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 1-10, 1997.
29. D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
30. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. SIAM Journal on Computing, 28(1):164-191, 1999. Preliminary version in Proc. FOCS '94.
31. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. SIAM Journal on Computing, 28(1):164-191, 1999. Preliminary version in Proc. FOCS '94.
32. S. Khanna, M. Sudan, and D.P. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 11-20, 1997.
33. B. Karloff and U. Zwick. A (7/8 - ε)-approximation algorithm for MAX 3SAT? In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 406-415, 1997.
34. E. Petrank. The hardness of approximations: gap location. Computational Complexity, 4:133-157, 1994. Preliminary version in Proc. ISTCS '93.
35. E. Petrank. The hardness of approximations: gap location. Computational Complexity, 4:133-157, 1994. Preliminary version in Proc. ISTCS '93.
36. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991. Preliminary version in Proc. STOC '88.
37. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991. Preliminary version in Proc. STOC '88.
38. G.B. Sorkin and M. Sudan. Personal communication, 1997.
39. L. Trevisan. Positive linear programming, parallel approximation, and PCP's. In Proceedings of the 4th European Symposium on Algorithms, pages 62-75. LNCS 1136, Springer-Verlag, Berlin, 1996.
40. L. Trevisan. Reductions and (Non-)Approximability. Ph.D. thesis, University of Rome "La Sapienza", 1997. Also available at ECCC.
41. L. Trevisan. Reductions and (Non-)Approximability. Ph.D. thesis, University of Rome "La Sapienza", 1997. Also available at ECCC.
42. L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson. Gadgets, approximation, and linear programming. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 617-626, 1996.
43. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994. Preliminary version in Proc. SODA '92.
44. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994. Preliminary version in Proc. SODA '92.
45. U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 201-210, 1998.