Computer assisted proof of optimal approximability results

Authors:
Uri Zwick
Affiliations:
Tel Aviv University, Tel Aviv 69978, Israel
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 18
Cited 17

What every computer scientist should know about floating-point arithmetic

ACM Computing Surveys (CSUR)
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
A gentle introduction to NUMERICA

Artificial Intelligence - Special issue: artificial intelligence 40 years later
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Mathematica book (4th edition)

The Mathematica book (4th edition)
Improved approximation algorithms for MAX SAT

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Numerical computing with IEEE floating point arithmetic

Numerical computing with IEEE floating point arithmetic
The C++ Programming Language, Third Edition

The C++ Programming Language, Third Edition
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)

MAX CUT in cubic graphs

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating MIN k-SAT

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
MAX CUT in cubic graphs

Journal of Algorithms
A 1.375-Approximation Algorithm for Sorting by Transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Bipartite multigraphs with expander-like properties

Discrete Applied Mathematics
Sums of squares based approximation algorithms for MAX-SAT

Discrete Applied Mathematics
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Applying practice to theory

ACM SIGACT News
3-bit dictator testing: 1 vs. 5/8

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Conditional hardness for satisfiable 3-CSPs

Proceedings of the forty-first annual ACM symposium on Theory of computing
Improved approximation algorithms for MAX NAE-SAT and MAX SAT

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Randomized variants of Johnson's algorithm for MAX SAT

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A 1.375-approximation algorithm for sorting by transpositions

WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Solution of the propeller conjecture in R3

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We obtain computer assisted proofs of several spherical volume inequalities that appear in the analysis of semidefinite programming based approximation algorithms for Boolean constraint satisfaction problems. These inequalities imply, in particular, that the performance ratio achieved by the MAX 3-SAT approximation algorithm of Karloff and Zwick is indeed 7/8, as conjectured by them, and that the performance ratio of the MAX 3-CSP algorithm of the author is indeed 1/2. Other results are also implied. The computer assisted proofs are obtained using a system called REALSEARCH, written by the author. This system uses interval arithmetic to produce rigorous proofs that certain collections of constraints in real variables have no real solution.