Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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
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
Conditional hardness for approximate coloring
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
SDP gaps and UGC-hardness for MAXCUTGAIN
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
How to Play Unique Games Using Embeddings
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Towards Sharp Inapproximability For Any 2-CSP
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
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
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
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
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
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
Towards computing the Grothendieck constant
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
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Approximability Distance in the Space of H-Colourability Problems
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
DEEP-SaM - Energy-Efficient Provisioning Policies for Computing Environments
GECON '09 Proceedings of the 6th International Workshop on Grid Economics and Business Models
Improved Inapproximability Results for Maximum k-Colorable Subgraph
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On Hardness of Pricing Items for Single-Minded Bidders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Conditional Hardness of Approximating Satisfiable Max 3CSP-q
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The positive semidefinite Grothendieck problem with rank constraint
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the inapproximability of vertex cover on k-partite k-uniform hypergraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
SDP gaps for 2-to-1 and other label-cover variants
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Improved rounding for parallel repeated unique games
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Low-energy automated scheduling of computing resources
Proceedings of the 1st ACM/IEEE workshop on Autonomic computing in economics
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Nearly optimal NP-hardness of vertex cover on k-uniform k-partite hypergraphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Min CSP on four elements: moving beyond submodularity
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Bounds on locally testable codes with unique tests
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Approximating CSPs with global cardinality constraints using SDP hierarchies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The complexity of conservative valued CSPs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Journal of Computer and System Sciences
Subsampling mathematical relaxations and average-case complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On LP-based approximability for strict CSPs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximating Linear Threshold Predicates
ACM Transactions on Computation Theory (TOCT)
Towards a unified architecture for in-RDBMS analytics
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of submodular function minimisation on diamonds
Discrete Optimization
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
SIAM Journal on Computing
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
An invariance principle for polytopes
Journal of the ACM (JACM)
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A characterization of approximation resistance for even k-partite CSPs
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
The complexity of conservative valued CSPs
Journal of the ACM (JACM)
On the usefulness of predicates
ACM Transactions on Computation Theory (TOCT)
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Majority is stablest: discrete and SoS
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The complexity of finite-valued CSPs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Explicit Optimal Hardness via Gaussian Stability Results
ACM Transactions on Computation Theory (TOCT)
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
| Hi-index | 0.00 |
Semidefinite Programming(SDP) is one of the strongest algorithmic techniques used in the design of approximation algorithms. In recent years, Unique Games Conjecture(UGC) has proved to be intimately connected to the limitations of Semidefinite Programming. Making this connection precise, we show the following result : If UGC is true, then for every constraint satisfaction problem(CSP) the best approximation ratio is given by a certain simple SDP. Specifically, we show a generic conversion from SDP integrality gaps to UGC hardness results for every CSP. This result holds both for maximization and minimization problems over arbitrary finite domains. Using this connection between integrality gaps and hardness results we obtain a generic polynomial-time algorithm for all CSPs. Assuming the Unique Games Conjecture, this algorithm achieves the optimal approximation ratio for every CSP. Unconditionally, for all 2-CSPs the algorithm achieves an approximation ratio equal to the integrality gap of a natural SDP used in literature. Further the algorithm achieves at least as good an approximation ratio as the best known algorithms for several problems like MaxCut, Max2Sat, MaxDiCut and Unique Games.