Some optimal inapproximability results
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIGACT news complexity theory column 34
ACM SIGACT News
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Property testers for dense constraint satisfaction programs on finite domains
Random Structures & Algorithms
Random MAX SAT, random MAX CUT, and their phase transitions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
The Complexity of Boolean Constraint Satisfaction Local Search Problems
Annals of Mathematics and Artificial Intelligence
Journal of Algorithms
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Combinatorics, Probability and Computing
MAX k-CUT and approximating the chromatic number of random graphs
Random Structures & Algorithms
Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An LP-designed algorithm for constraint satisfaction
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ACM SIGACT News
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
3-bit dictator testing: 1 vs. 5/8
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SOFIE: a self-organizing framework for information extraction
Proceedings of the 18th international conference on World wide web
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Finding an unknown acyclic orientation of a given graph
Combinatorics, Probability and Computing
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
SIAM Journal on Computing
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Linear-programming design and analysis of fast algorithms for Max 2-CSP
Discrete Optimization
Quasi-randomness and algorithmic regularity for graphs with general degree distributions
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Journal of Combinatorial Theory Series B
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
We present a linear programming-based method for finding "gadgets," i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method we present a number of new, computer-constructed gadgets for several different reductions. This method also answers a question posed by Bellare, Goldreich, and Sudan [SIAM J. Comput., 27 (1998), pp. 804--915] of how to prove the optimality of gadgets: linear programming duality gives such proofs.The new gadgets, when combined with recent results of Hå stad [ Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 1--10], improve the known inapproximability results for MAX CUT and MAX DICUT, showing that approximating these problems to within factors of $16/17 + \epsilon$ and $12/13+ \epsilon,$ respectively, is NP-hard for every $\epsilon 0$. Prior to this work, the best-known inapproximability thresholds for both problems were 71/72 (M. Bellare, O. Goldreich, and M. Sudan [ SIAM J. Comput., 27 (1998), pp. 804--915]). Without using the gadgets from this paper, the best possible hardness that would follow from Bellare, Goldreich, and Sudan and Hå{s}tad is $18/19$. We also use the gadgets to obtain an improved approximation algorithm for MAX3 SAT which guarantees an approximation ratio of .801. This improves upon the previous best bound (implicit from M. X. Goemans and D. P. Williamson [ J. ACM, 42 (1995), pp. 1115--1145]; U. Feige and M. X. Goemans [ Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995, pp. 182--189]) of .7704.