Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs

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

Volumn 1610, Issue , 1999, Pages 202-217

  Halperin, Eran ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

MAX-SAT; NATURAL GENERALIZATION; PERFORMANCE GUARANTEES; ROUNDING PROCEDURES; SEMI-DEFINITE PROGRAMMING RELAXATIONS; SEMIDEFINITE PROGRAMS;

APPROXIMATION ALGORITHMS;

EID: 84948986297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48777-8_16     Document Type: Conference Paper

References (31)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5:13-51, 1995.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501-555, 1998.
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45:70-122, 1998.
4. T. Asano. Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems, Ramat Gan, Israel, pages 24-37, 1997.
5. T. Asano, T. Ono, and T. Hirata. Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3:388-404, 1996.
6. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal on Computing, 27:804-915, 1998.
7. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25rd Annual ACM Symposium on Theory of Computing, San Diego, California, pages 294-304, 1993. See Errata in STOC’94.
8. H.S.M. Coxeter. The functions of Schläfli and Lobatschefsky. Quarterly Journal of of Mathematics (Oxford), 6:13-29, 1935.
9. 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 the 3nd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, pages 182- 189, 1995.
10. 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:268-292, 1996.
11. M.X. Goemans and D.P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7:656- 666, 1994.
12. 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.
13. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and, Combinatorial Optimization. Springer Verlag, 1993. Second corrected edition.
14. J. Håstad. Some optimal inapproximability results. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, pages 1-10, 1997. Full version available as E-CCC Report number TR97-037.
15. W.Y. Hsiang. On infinitesimal symmetrization and volume formula for spherical or hyperbolic tetrahedrons. Quarterly Journal of Mathematics (Oxford), 39:463-468, 1988.
16. D.S. Johnson. Approximation algorithms for combinatorical problems. Journal of Computer and System Sciences, 9:256-278, 1974.
17. H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38rd Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, pages 406-415, 1997.
18. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proceedings of the 35rd Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, New Mexico, pages 819-830, 1994.
19. Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, 1994.
20. Y. E. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9:141-160, 1998.
21. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
22. P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37:130- 143, 1988.
23. P. Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
24. 2 < 1. Quarterly Journal of Mathematics (Oxford), 2:269-300, 1858. Continued in Vol. 3 (1860), pp. 54-68 and pp. 97-108.
25. L. Trevisan. Approximating satisfiable satisfiability problems. In Proceedings of the 5th European Symposium on Algorithms, Graz, Austria, 1997. 472-485.
26. L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson. Gadgets, approximation, and linear programming (extended abstract). In Proceedings of the 37rd Annual IEEE Symposium on Foundations of Computer Science, Burlington, Vermont, pages 617-626, 1996.
27. E.B. Vinberg. Volumes of non-Euclidean polyhedra. Russian Math. Surveys, 48:15- 45, 1993.
28. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994.
29. U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 201- 210, 1998.
30. U. Zwick. Finding almost-satisfying assignments. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, pages 551-560, 1998.
31. U. Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, 1999. To appear.