On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Recycling queries in PCPs and in linearity tests (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Constructing worst case instances for semidefinite programming based approximation algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Semidefinite Programming Relaxations of (2+p)-SAT
Annals of Mathematics and Artificial Intelligence
Improved approximation of max-cut on graphs of bounded degree
Journal of Algorithms
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Improved approximation algorithms for MAX SAT
Journal of Algorithms
A manifesto for the computational method
Theoretical Computer Science
MAX3SAT is exponentially hard to approximate if NP has positive dimension
Theoretical Computer Science
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Random Instance Generation for MAX 3SAT
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Discrete Applied Mathematics
Journal of Algorithms
Tutorial on computational complexity
Interfaces
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Journal of Algorithms
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ACM SIGACT News
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
MiniMaxSAT: a new weighted Max-SAT solver
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Some simplified forms of reasoning with distance-based entailments
Canadian AI'08 Proceedings of the Canadian Society for computational studies of intelligence, 21st conference on Advances in artificial intelligence
Simulating Quantum Correlations with Finite Communication
SIAM Journal on Computing
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
ESA'11 Proceedings of the 19th European conference on Algorithms
Secure set membership using 3SAT
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Sums of squares, satisfiability and maximum satisfiability
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
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
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
MAX-SAT for formulas with constant clause density can be solved faster than in O(2n) time
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We describe a randomized approximation algorithm which takes an instance of MAX 3SAT as input. If the instance---a collection of clauses each of length at most three---is satisfiable, then the expected weight of the assignment found is at least 7/8 of optimal. We provide strong evidence (but not a proof) that the algorithm performs equally well on arbitrary MAX 3SAT instances. Our algorithm uses semidefinite programming and may be seen as a sequel to the MAX CUT algorithm of Goemans and Williamson and the MAX 2SAT algorithm of Feige and Goemans. Though the algorithm itself is fairly simple, its analysis is quite complicated as it involves the computation of volumes of spherical tetrahedra. Hastad has recently shown that, assuming PNP, no polynomial-time algorithm for MAX 3SAT can achieve a performance ratio exceeding 7/8, even when restricted to satisfiable instances of the problem. Our algorithm is therefore optimal in this sense. We also describe a method of obtaining direct semidefinite relaxations of any constraint satisfaction problem of the form MAXCSP(F), where F is a finite family of Boolean functions. Our relaxations are the strongest possible within a natural class of semidefinite relaxations.