Results 1  10
of
33
Expander Flows, Geometric Embeddings and Graph Partitioning
 IN 36TH ANNUAL SYMPOSIUM ON THE THEORY OF COMPUTING
, 2004
"... We give a O( log n)approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)approximation of Leighton and Rao (1988). We use a wellknown semidefinite relaxation with triangle inequality constraints. Central to our analysis is a ..."
Abstract

Cited by 238 (18 self)
 Add to MetaCart
We give a O( log n)approximation algorithm for sparsest cut, balanced separator, and graph conductance problems. This improves the O(log n)approximation of Leighton and Rao (1988). We use a wellknown semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in , whose proof makes essential use of a phenomenon called measure concentration.
The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into ℓ1
 In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science
, 2005
"... 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 ℓ1 with constant distortion.” We show that for every δ>0, and for large enough n, there is an npoint negative type metric which requires distortion atl ..."
Abstract

Cited by 125 (10 self)
 Add to MetaCart
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 ℓ1 with constant distortion.” We show that for every δ>0, and for large enough n, there is an npoint negative type metric which requires distortion atleast (log log n) 1/6−δ to embed into ℓ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 superconstant hardness results for (nonuniform) 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−δ integrality gap for (nonuniform) SPARSEST CUT and MINIMUM UNCUT, and an optimal integrality gap for MAXIMUM CUT. All our SDP solutions satisfy the socalled “triangle inequality ” constraints. This also shows, for the first time, that the triangle inequality constraints do not add any power to the GoemansWilliamson’s SDP relaxation of MAXIMUM CUT. The integrality gap for SPARSEST CUT immediately implies a lower bound for embedding negative type metrics into ℓ1. It also disproves the nonuniform 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.
Euclidean distortion and the Sparsest Cut
 In Proceedings of the 37th Annual ACM Symposium on Theory of Computing
, 2005
"... BiLipschitz embeddings of finite metric spaces, a topic originally studied in geometric analysis and Banach space theory, became an integral part of theoretical computer science following work of Linial, London, and Rabinovich [29]. They presented an algorithmic version of a result of Bourgain [8] ..."
Abstract

Cited by 93 (20 self)
 Add to MetaCart
BiLipschitz embeddings of finite metric spaces, a topic originally studied in geometric analysis and Banach space theory, became an integral part of theoretical computer science following work of Linial, London, and Rabinovich [29]. They presented an algorithmic version of a result of Bourgain [8] which shows that every
The multiplicative weights update method: a meta algorithm and applications
, 2005
"... Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analysis are usually very similar and rely on an exponential potential function. We present a simple meta algorithm that unifies ..."
Abstract

Cited by 53 (10 self)
 Add to MetaCart
Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analysis are usually very similar and rely on an exponential potential function. We present a simple meta algorithm that unifies these disparate algorithms and drives them as simple instantiations of the meta algorithm. 1
IMPROVED LOWER BOUNDS FOR EMBEDDINGS INTO L1
 SIAM J. COMPUT.
, 2009
"... We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bo ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
We improve upon recent lower bounds on the minimum distortion of embedding certain finite metric spaces into L1. In particular, we show that for every n ≥ 1, there is an npoint metric space of negative type that requires a distortion of Ω(log log n) for such an embedding, implying the same lower bound on the integrality gap of a wellknown semidefinite programming relaxation for sparsest cut. This result builds upon and improves the recent lower bound of (log log n) 1/6−o(1) due to Khot and Vishnoi [The unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l1, in Proceedings of the 46th Annual IEEE Symposium
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
 IN FOCS
, 2005
"... Semidefinite programming (SDP) relaxations appear in many recent approximation algorithms but the only general technique for solving such SDP relaxations is via interior point methods. We use a Lagrangianrelaxation based technique (modified from the papers of Plotkin, Shmoys, and Tardos (PST), and ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
Semidefinite programming (SDP) relaxations appear in many recent approximation algorithms but the only general technique for solving such SDP relaxations is via interior point methods. We use a Lagrangianrelaxation based technique (modified from the papers of Plotkin, Shmoys, and Tardos (PST), and Klein and Lu) to derive faster algorithms for approximately solving several families of SDP relaxations. The algorithms are based upon some improvements to the PST ideas — which lead to new results even for their framework — as well as improvements in approximate eigenvalue computations by using random sampling.
LOCAL VERSUS GLOBAL PROPERTIES OF METRIC SPACES
, 2012
"... Motivated by applications in combinatorial optimization, we study the extent to which the global properties of a metric space, and especially its embeddability into ℓ1 with low distortion, are determined by the properties of its small subspaces. We establish both upper and lower bounds on the disto ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Motivated by applications in combinatorial optimization, we study the extent to which the global properties of a metric space, and especially its embeddability into ℓ1 with low distortion, are determined by the properties of its small subspaces. We establish both upper and lower bounds on the distortion of embedding locally constrained metrics into various target spaces. Other aspects of locally constrained metrics are studied as well, in particular, how far are those metrics from general metrics.
Ramsey partitions and proximity data structures
 J. European Math. Soc 9
"... This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The nonlinear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric sp ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The nonlinear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (a.k.a. the nonlinear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman in [8]). We then proceed to construct optimal Ramsey partitions, and use them to show that for everyε∈(0, 1), any npoint metric space has a subset of size n 1−ε which embeds into Hilbert space with distortion O(1/ε). This result is best possible and improves part of the metric Ramsey theorem of Bartal, Linial, Mendel and Naor [5], in addition to considerably simplifying its proof. We use our new Ramsey partitions to design the best known approximate distance oracles when the distortion is large, closing a gap left open by Thorup and Zwick in [31]. Namely, we show that for any n point metric space X, and k≥1, there exists an O(k)approximate distance oracle whose storage requirement is O ( n 1+1/k) , and whose query time is a universal constant. We also discuss applications of Ramsey partitions to various other geometric data structure problems, such as the design of efficient data structures for approximate ranking.
A (log n) Ω(1) integrality gap for the Sparsest Cut SDP
 IN PROCEEDINGS OF 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2009
, 2009
"... We show that the GoemansLinial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap (log n) Ω(1). This is achieved by exhibiting npoint metric spaces of negative type whose L1 distortion is (log n) Ω(1). Our result is based on quantitative bounds on the ra ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
We show that the GoemansLinial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap (log n) Ω(1). This is achieved by exhibiting npoint metric spaces of negative type whose L1 distortion is (log n) Ω(1). Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to L1 when restricted to cosets of the center.