Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems

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

Volumn 2337 LNCS, Issue , 2002, Pages 67-82

  Lewin, Michael ^a   Livnat, Dror ^a   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; GEOMETRY; ALGORITHMS; OPTIMIZATION;

2-SAT PROBLEMS; INAPPROXIMABILITY; MAX-CUT PROBLEM; PERFORMANCE RATIO; ROUNDING PROCEDURES; SEMI-DEFINITE PROGRAMMING RELAXATIONS; SKEWED DISTRIBUTION;

INTEGER PROGRAMMING;

EID: 84868631424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_6     Document Type: Conference Paper

References (13)

1. N. Alon and B. Sudakov. Bipartite subgraphs and the smallest eigenvalue. Combinatorics, Probability & Computing, 9:1-12, 2000.
2. N. Alon, B. Sudakov, and U. Zwick. Constructing worst case instances for semidefinite programming based approximation algorithms. SIAM Journal on Discrete Mathematics, 15:58-72, 2002.
3. 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 3rd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, pages 182-189, 1995.
4. U. Feige and M. Langberg. The RPR2 rounding technique for semidefinite programs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, pages 213-224, 2001.
5. 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.
6. 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.
7. H. Karloff. How good is the Goemans-Williamson MAX CUT algorithm? SIAM Journal on Computing, 29:336-350, 1999.
8. S. Matuura and T. Matsui. 0.863-approximation algorithm for MAX DICUT. In Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, Proceedongs of APPROX-RANDOM'01, Berkeley, California, pages 138-146, 2001.
9. 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.
10. S. Mahajan and H. Ramesh. Derandomizing approximation algorithms based on semidefinite programming. SIAM Journal on Computing, 28:1641-1663, 1999.
11. L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson. Gadgets, approximation, and linear programming. SIAM Journal on Computing, 29:2074-2097, 2000.
12. U. Zwick. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Submitted for publication, 2000.
13. U. Zwick. Computer assisted proof of optimal approximability results. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 496-505, 2002.