Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Some optimal inapproximability results
Journal of the ACM (JACM)
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Proceedings of the 8th 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
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
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
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
SDP Integrality Gaps with Local ell_1-Embeddability
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Quantum de finetti theorems under local measurements with applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Product-state approximations to quantum ground states
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Guest column: the quantum PCP conjecture
ACM SIGACT News
Lift-and-Project methods for set cover and knapsack
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Proceedings of the 5th conference on Innovations in theoretical computer science
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
Journal of Combinatorial Optimization
Hi-index | 0.00 |
This work is concerned with approximating constraint satisfaction problems (CSPs) with additional global cardinality constraints. For example, Max Cut is a boolean CSP where the input is a graph G = (V, E) and the goal is to find a cut S ∪ S = V that maximizes the number of crossing edges, |E(S, S)|. The Max Bisection problem is a variant of Max Cut with a global constraint that each side of the cut has exactly half the vertices, i.e., |S| = |V|/2. Several other natural optimization problems like Min Bisection and approximating Graph Expansion can be formulated as CSPs with global cardinality constraints. In this work, we formulate a general approach towards approximating CSPs with global cardinality constraints using SDP hierarchies. To demonstrate the approach we present the following results: • Using the Lasserre hierarchy, we present an algorithm that runs in time O(npoly(1/ε)) that given an instance of Max Bisection with value 1 − ε, finds a bisection with value 1 − O(√ε). This approximation is near-optimal (up to constant factors in O()) under the Unique Games Conjecture. • By a computer-assisted proof, we show that the same algorithm also achieves a 0.85-approximation for Max Bisection, improving on the previous bound of 0.70 (note that it is Unique Games hard to approximate better than a 0.878 factor). The same algorithm also yields a 0.92-approximation for Max 2-Sat with cardinality constraints. • For every CSP with a global cardinality constraints, we present a generic conversion from integrality gap instances for the Lasserre hierarchy to a dictatorship test whose soundness is at most integrality gap. Dictatorship testing gadgets are central to hardness results for CSPs, and a generic conversion of the above nature lies at the core of the tight Unique Games based hardness result for CSPs [Rag08].