Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
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
Lectures on Discrete Geometry
On the optimality of the random hyperplane rounding technique for max cut
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Nonembeddability theorems via Fourier analysis
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
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
On Non-Approximability for Quadratic Programs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Directed metrics and directed graph partitioning problems
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
Improved lower bounds for embeddings into L1
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
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Integrality gaps for sparsest cut and minimum linear arrangement problems
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)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Balanced max 2-sat might not be the hardest
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Compacting cuts: a new linear formulation for minimum cut
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Linear programming relaxations of maxcut
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
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
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 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
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Coarse Differentiation and Multi-flows in Planar Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
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
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Partitioning graphs into balanced components
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)
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
Drawing (Complete) Binary Tanglegrams
Graph Drawing
Compacting cuts: A new linear formulation for minimum cut
ACM Transactions on Algorithms (TALG)
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
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
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximate Lasserre integrality gap for 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
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
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Towards Sharp Inapproximability for Any 2-CSP
SIAM Journal on Computing
Unique Games with Entangled Provers Are Easy
SIAM Journal on Computing
Near-optimal distortion bounds for embedding doubling spaces into L1
Proceedings of the forty-third annual ACM symposium on Theory of computing
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
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
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Hypercontractivity, sum-of-squares proofs, and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for semi-random partitioning problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Small bipartite subgraph polytopes
Operations Research Letters
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation
Discrete Applied Mathematics
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Classical and quantum partition bound and detector inefficiency
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sparsest cut on quotients of the hypercube
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sparsest cut on quotients of the hypercube
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
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
Cones of multipowers and combinatorial optimization problems
Computational Mathematics and Mathematical Physics
Hi-index | 0.00 |
In this paper we disprove the following conjecture due to Goemans [16] and Linial [24] (also see [5, 26]): "Every negative type metric embeds into \ell 1 with constant distortion." We show that for every \delta} \ge 0, and for large enough n, there is an n-point negative type metric which requires distortion at-least \log \log n^{1/6 - \delta} to embed into \ell 1. Surprisingly, our construction is inspired by the Unique Games Conjecture (UGC) of Khot [19], establishing a previously unsuspected connection between PCPs and the theory of metric embeddings. We first prove that the UGC implies super-constant hardness results for (non-uniform) SPARSEST CUT and MINIMUM UNCUT problems. It is already known that the UGC also implies an optimal hardness result for MAXIMUM CUT [20]. Though these hardness results depend on the UGC, the integrality gap instances rely "only" on the PCP reductions for the respective problems. Towards this, we first construct an integrality gap instance for a natural SDP relaxation of UNIQUE GAMES. Then, we "simulate" the PCP reduction and "translate" the integrality gap instance of UNIQUE GAMES to integrality gap instances for the respective cut problems! This enables us to prove a \log \log n^{1/6 - \delta} integrality gap for (non-uniform) SPARSEST CUT and MINIMUM UNCUT, and an optimal integrality gap for MAXIMUM CUT. All our SDP solutions satisfy the so-called "triangle inequality" constraints. This also shows, for the first time, that the triangle inequality constraints do not add any power to the Goemans-Williamson驴s SDP relaxation of MAXIMUM CUT. The integrality gap for SPARSEST CUT immediately implies a lower bound for embedding negative type metrics into \ell 1. It also disproves the non-uniform version of Arora, Rao and Vazirani驴s Conjecture [5], asserting that the integrality gap of the SPARSEST CUT SDP, with the triangle inequality constraints, is bounded from above by a constant.