Every 2-CSP allows nontrivial approximation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Unique Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On Non-Approximability for Quadratic Programs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Correlation clustering with a fixed number of clusters
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
New approximation guarantee for chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Information Processing Letters
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Linear programming relaxations of maxcut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
Approximating maximum satisfiable subsystems of linear equations of bounded width
Information Processing Letters
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unique games on expanding constraint graphs are easy: extended abstract
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An efficient sparse regularity concept
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Conditional Hardness of Approximating Satisfiable Max 3CSP-q
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A polynomial time approximation scheme for k-consensus clustering
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Submodular secretary problem and extensions
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating linear threshold predicates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An Efficient Sparse Regularity Concept
SIAM Journal on Discrete Mathematics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Optimal allocation in combinatorial auctions with quadratic utility functions
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On unique games with negativeweights
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
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
Hypercontractivity, sum-of-squares proofs, and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Journal of Combinatorial Optimization
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Journal of Combinatorial Optimization
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
In this paper we give evidence suggesting that MAXCUT is NP-hard to approximate to within a factor of 驴_GW + 驴, for all 驴 0, where 驴_GW denotes the approximation ratio achieved by the Goemans-Williamson algorithm [14], 驴_GW 驴 .878567. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; and, b) a very believable conjecture we call the Majority Is Stablest conjecture. These results indicate that the geometric nature of the Goemans-Williamson algorithm might be intrinsic to the MAX-CUT problem. The same two conjectures also imply that it is NP-hard to β + e)-approximate MAX-2SAT, where β 驴 .943943 is the minimum of({{2 + \frac{2}{\pi }\theta )} \mathord{\left/ {\vphantom {{2 + \frac{2}{\pi }\theta )} {(3 - \cos (\theta ))}}} \right. \kern-\nulldelimiterspace} {(3 - \cos (\theta ))}} on (\frac{\pi }{2},\pi ). Motivated by our proof techniques, we show that if the MAX-2CSP and MAX-2SAT problems are slightly restricted 驴 in a way that seems to retain all their hardness 驴 then they have (驴_GW - 驴)- and (β - 驴)-approximation algorithms, respectively. Though we are unable to prove the Majority Is Stablest conjecture, we give some partial results and indicate possible directions of attack. Our partial results are enough to imply that MAX-CUT is hard to (\frac{3}{4} + \frac{1}{{2\pi }} + \varepsilon )-approximate (驴 .909155), assuming only the Unique Games conjecture. We also discuss MAX-2CSP problems over non-boolean domains and state some related results and conjectures. We show, for example, that the Unique Games conjecture implies that it is hard to approximate MAX-2LIN(q) to within any constant factor.