Approximating MIN κ-SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 465-475

  Avidor, Adi ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

2-SAT PROBLEMS; 3-SAT PROBLEMS; HARDNESS OF APPROXIMATION; SAT PROBLEMS;

ARTIFICIAL INTELLIGENCE; ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 25844437759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_41     Document Type: Conference Paper

References (24)

1. C. Bazgan and W. Fernandez de la Vega. A polynomial time approximation scheme for dense min2sat. In Proc. 12th Int. Symp. on Fundamentals of Computation Theory, Lecture Notes in Comput. Sci. 1684, pages 91-99. Springer-Verlag, 1999.
2. P. Berman and T. Fujito. Onapproximation properties of the independent set problem for low degree graphs. Theory of Computing Systems, 32(2):115-132, 1999.
3. P. Berman and M. Karpinski. On some tighter inapproximability results (extended abstract). In Proceedings of ICALP'99, pages 200-209, 1999.
4. D. Bertsimas, C. Teo, and R. Vohra. On dependent randomized rounding algorithms. Oper. Res. Lett., 24(3):105-114, 1999.
5. R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2(2):198-203, 1981.
6. R. Bar-Yehuda and S. Even. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics, 25:27-45, 1985.
7. I. Dinur and S. Safra. The importance of being biased. In Proceedings of STOC'02, pages 33-42, 2002. (Pubitemid 35009358)
8. U. Feige and M.X. Goemans. Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX-DICUT. In Proceedings of ISTCS'95, pages 182-189, 1995.
9. M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
10. E. Halperin. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In Proceedings of SODA'00, pages 329-337, 2000.
11. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48:798-859, 2001.
12. D.S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11(3):555-556, 1982.
13. D.S. Hochbaum. Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6(3):243-254, 1983.
14. D.S. Hochbaum. Instant recognition of polynomial time solvability, half itegrality and 2-approximations. In Proceedongs of APPROX'00, pages 2-14, 2000.
15. D. Hochbaum and A. Pathria. Approximating a generalization of MAX 2SAT and MIN 2SAT. Discrete Applied Mathematics, 107(1-3):41-59, 2000.
16. R. Kohli, R. Krishnamurti, and P. Mirchandani. The minimum satisfiability problem. Discrete Mathematics, 7:275-283, 1994.
17. M. Lewin, D. Livnat, and U. Zwick. Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In Proceedings of IPCO'02, pages 67-82, 2002.
18. S. Matuura and T. Matsui. 0.863-approximation algorithm for MAX DICUT. In Proceedongs of APPROX-RANDOM'01, pages 138-146, 2001. (Pubitemid 33325647)
19. S. Matuura and T. Matsui. 0.935-approximation randomized algorithm for MAX 2SAT and its derandomization. Technical Report METR 2001-03, Department of Mathematical Engineering and Information Physics, the University of Tokyo, Japan, September 2001.
20. M.V. Marathe and S.S. Ravi. On approximation algorithms for the minimum satisfiability problem. Information Processing Letters, 58:23-29, 1996. (Pubitemid 126407342)
21. S. Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28:1641-1663, 1999. (Pubitemid 129304146)
22. B. Monien and E. Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Informatica, 22(1):115-123, 1985. (Pubitemid 15511508)
23. L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29:2074-2097, 2000. (Pubitemid 32138259)
24. U. Zwick. Computer assisted proof of optimal approximability results. In Proceedings of SODA'02, pages 496-505, 2002.