We consider metrical task systems on tree metrics, and present an $O(\mathrm{depth} \times \log n)$-competitive randomized algorithm based on the mirror descent framework. For the special case of HSTs, we refine the standard approach based on combining unfair metrical task systems, yielding an $O(\log n)$-competitive algorithm. This is tight up to the implicit constant factor. Using known random embeddings of finite metric spaces into HSTs, this yields an $O((\log n)^2)$-competitive algorithm for general $n$-point spaces.
We give an \(O((\log k)^6)\)-competitive randomized algorithm for the k-server problem on general metric spaces. The best previous result independent of the underlying metric space is the 2k-1 competitive ratio established for the deterministic work function algorithm by Koutsoupias and Papadimitriou (1995).
Since deterministic algorithms can do no better than k on any metric space with at least k+1 points, this establishes that for every metric space on which the problem is non-trivial, randomized algorithms give an exponential improvement over determinsitic algorithms. The approach is via reduction to potential-based algorithms for the fractional k-server problem on ultrametrics.
We present an \(O((\log k)^2)\)-competitive randomized algorithm for the k-server problem on hierarchically separated trees (HSTs). This is the first o(k)-competitive randomized algorithm for which the competitive ratio is independent of the size of the underlying HST. Our algorithm is designed in the framework of online mirror descent where the mirror map is a multiscale entropy.
When combined with Bartal’s static HST embedding reduction, this leads to an \(O((\log k)^2 \log n)\)-competitive algorithm on any n-point metric space. We give a new dynamic HST embedding that yields an \(O((\log k)^3 \log \Delta)\)-competitive algorithm on any metric space where the ratio of the largest to smallest non-zero distance is at most \(\Delta\).
[credit: Bernd Sturmfels]
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on n-vertex graphs are not the linear image of the feasible region of any SDP (i.e., any spectrahedron) of dimension less than \(2^{n^c}\), for some constant \(c > 0\). This result yields the first super-polynomial lower bounds on the semidefinite extension complexity of any explicit family of polytopes.
Our results follow from a general technique for proving lower bounds on the positive semidefinite rank of a matrix. To this end, we establish a close connection between arbitrary SDPs and those arising from the sum-of-squares SDP hierarchy. For approximating maximum constraint satisfaction problems, we prove that SDPs of polynomial-size are equivalent in power to those arising from degree-O(1) sum-of-squares relaxations. This result implies, for instance, that no family of polynomial-size SDP relaxations can achieve better than a 7/8-approximation for MAX-3-SAT.
[ PPT slides ]
Best paper award, STOC 2015
@inproceedings{LRS15, author = {James R. Lee and Prasad Raghavendra and David Steurer}, title = {Lower Bounds on the Size of Semidefinite Programming Relaxations}, booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015}, pages = {567--576}, year = {2015}, note = {Full version at \verb|https://arxiv.org/abs/1411.6317|} }
We study the computational power of general symmetric relaxations for combinatorial optimization problems, both in the linear programming (LP) and semidefinite programming (SDP) case. We show new connections to explicit LP and SDP relaxations, like those obtained from standard hierarchies.
@inproceedings{DBLP:conf/coco/LeeRST14, author = {James R. Lee and Prasad Raghavendra and David Steurer and Ning Tan}, title = {On the Power of Symmetric {LP} and {SDP} Relaxations}, booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver, BC, Canada, June 11-13, 2014}, pages = {13--21}, year = {2014}, }
[credit: Fiorini, Rothvoss, and Tiwary]
We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful as programs arising from a constant number of rounds of the Sherali-Adams hierarchy. In particular, any polynomial-sized linear program for Max Cut has an integrality gap of 1/2 and any such linear program for Max 3-Sat has an integrality gap of 7/8.
Video: Linear programming and constraint satisfaction (Simons Institute)
@article {CLRS16, AUTHOR = {Chan, Siu On and Lee, James R. and Raghavendra, Prasad and Steurer, David}, TITLE = {Approximate constraint satisfaction requires large {LP} relaxations}, JOURNAL = {J. ACM}, FJOURNAL = {Journal of the ACM}, VOLUME = {63}, YEAR = {2016}, NUMBER = {4}, PAGES = {Art. 34, 22}, }
The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut conditions are satisfied. Simple examples show that a similar theorem is impossible in the node-capacitated setting. Nevertheless, we prove that an approximate flow/cut theorem does hold: For some universal c > 0, if the node cut conditions are satisfied, then one can simultaneously route a c-fraction of all the demands.
This answers an open question of Chekuri and Kawarabayashi. More generally, we show that this holds in the setting of multi-commodity polymatroid networks introduced by Chekuri, et. al. Our approach employs a new type of random metric embedding in order to round the convex programs corresponding to these more general flow problems.
@article {LMM15, AUTHOR = {Lee, James R. and Mendel, Manor and Moharrami, Mohammad}, TITLE = {A node-capacitated {O}kamura-{S}eymour theorem}, JOURNAL = {Math. Program.}, FJOURNAL = {Mathematical Programming}, VOLUME = {153}, YEAR = {2015}, NUMBER = {2, Ser. A}, PAGES = {381--415}, }
We study the quantitative geometry of graphs in terms of their genus, using the structure of certain cut graphs. These are subgraphs whose removal leaves a planar graph.
@inproceedings{DBLP:conf/soda/LeeS10, author = {James R. Lee and Anastasios Sidiropoulos}, title = {Genus and the Geometry of the Cut Graph}, booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010}, pages = {193--201}, year = {2010}, }
Indyk and Sidiropoulos (2007) proved that any orientable graph of genus $g$ can be probabilistically embedded into a graph of genus $g−1$ with constant distortion. Viewing a graph of genus $g$ as embedded on the surface of a sphere with $g$ handles attached, Indyk and Sidiropoulos’ method gives an embedding into a distribution over planar graphs with distortion $O(g)$ by iteratively removing the handles. By removing all g handles at once, we present a probabilistic embedding with distortion $O(g^2)$ for both orientable and non-orientable graphs. Our result is obtained by showing that the nimum-cut graph of Erickson and Har Peled (2004) has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma of Lee and Sidiropoulos (2009).
@article {BLS10, AUTHOR = {Borradaile, Glencora and Lee, James R. and Sidiropoulos, Anastasios}, TITLE = {Randomly removing {$g$} handles at once}, JOURNAL = {Comput. Geom.}, FJOURNAL = {Computational Geometry. Theory and Applications}, VOLUME = {43}, YEAR = {2010}, NUMBER = {8}, PAGES = {655--662}, }
[credit: Patrick Massot]
We prove that the function \(d : \mathbb{R}^3 \times \mathbb{R}^3 \to [0,\infty)\) given by
is a metric on \(\mathbb{R}^3\) such that \((\mathbb{R}^3, \sqrt{d})\) is isometric to a subset of Hilbert space, yet \((\mathbb{R}^3,d)\) does not admit a bi-Lipschitz embedding into \(L_1\). This yields a new simple counter example to the Goemans-Linial conjecture on the integrality gap of the SDP relaxation of the Sparsest Cut problem.
Our methods involve Fourier analytic techniques, combined with a breakthrough of Cheeger and Kleiner, along with classical results of Pansu on the differentiability of Lispchitz functions on the Heisenberg group.
@inproceedings{LN06, author = {James R. Lee and Assaf Naor}, title = {Lp metrics on the Heisenberg group and the Goemans-Linial conjecture}, booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}, pages = {99--108}, year = {2006}, }
We present an $O(\sqrt{\log n} \log \log n)$ upper bound on the $(n-1)$-dimensional volume distortion of $n$-point subsets of a Euclidean space, nearly resolving the main open questions of [Dunagan-Vempala 2001] and [Krauthgamer-Linial-Magen 2004]. The best previous bound was $O(\log n)$ and our bound is nearly tight, as even the $2$-dimensional volume distortion of an $n$-vertex path is $\Omega(\sqrt{\log n})$.
@article {LeeVolume09, AUTHOR = {Lee, James R.}, TITLE = {Volume distortion for subsets of {E}uclidean spaces}, JOURNAL = {Discrete Comput. Geom.}, FJOURNAL = {Discrete \& Computational Geometry. An International Journal of Mathematics and Computer Science}, VOLUME = {41}, YEAR = {2009}, NUMBER = {4}, PAGES = {590--615}, }
We observe that combining the techniques behind the Sparsest Cut SDP analysis of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an $O(\sqrt{\log n} \log \log n)$-approximation for the minimum linear arrangement problem, improving over the previous bound of $O(\log n)$.
@article {FL07, AUTHOR = {Feige, Uriel and Lee, James R.}, TITLE = {An improved approximation ratio for the minimum linear arrangement problem}, JOURNAL = {Inform. Process. Lett.}, FJOURNAL = {Information Processing Letters}, VOLUME = {101}, YEAR = {2007}, NUMBER = {1}, PAGES = {26--29}, }
We prove that every \(n\)-point metric space of negative type (and, in particular, every \(n\)-point subset of \(L_1\)) embeds into a Euclidean space with distortion \(O(\sqrt{\log n} \log \log n)\), a result which is tight up to the iterated logarithm factor. As a consequence, we obtain the best known polynomial-time approximation algorithm for the Sparsest Cut problem with general demands. If the demand is supported on a set of size \(k\), we achieve an approximation ratio of \(O(\sqrt{\log k} \log \log k)\).
@article {LN08, AUTHOR = {Arora, Sanjeev and Lee, James R. and Naor, Assaf}, TITLE = {Euclidean distortion and the sparsest cut}, JOURNAL = {J. Amer. Math. Soc.}, FJOURNAL = {Journal of the American Mathematical Society}, VOLUME = {21}, YEAR = {2008}, NUMBER = {1}, PAGES = {1--21}, }
We develop the algorithmic theory of vertex separators, and its relation to embeddings of certain metric spaces. As a consequence, we obtain an \(O(\sqrt{\log n})\)-approximation for min-ratio vertex cuts in general graphs based on a new SDP relaxation and a tight analysis of its integrality gap.
Our results allow yield algorithms for constructing approximately optimal tree decompositions of graphs. If a graph has treewidth \(k\), we find a tree decomposition of width at most \(O(k \sqrt{\log k})\). If, additionally, the input graph excludes a fixed graph as a minor, we produce a tree decomposition of width \(O(k)\).
Related: A similar method gives improved bounds for the minimum linear arrangement problem.
@article {FHL08, AUTHOR = {Feige, Uriel and Hajiaghayi, Mohammadtaghi and Lee, James R.}, TITLE = {Improved approximation algorithms for minimum weight vertex separators}, JOURNAL = {SIAM J. Comput.}, FJOURNAL = {SIAM Journal on Computing}, VOLUME = {38}, YEAR = {2008}, NUMBER = {2}, PAGES = {629--657}, }
This paper establishes that a metric space $X$ supports approximate nearest-neighbor queries against any $n$-point subset with at most $\mathrm{poly}(\log n)$ query time if and only if one has certain quantitative estimates on the doubling constant of $n$-point subsets.
@article {KL05, AUTHOR = {Krauthgamer, Robert and Lee, James R.}, TITLE = {The black-box complexity of nearest-neighbor search}, JOURNAL = {Theoret. Comput. Sci.}, FJOURNAL = {Theoretical Computer Science}, VOLUME = {348}, YEAR = {2005}, NUMBER = {2-3}, PAGES = {262--276}, }
We establish lower bounds on the polynomial-time approximability of the vertex-connectivity variant of the Survivable Network Design Problem (SNDP) under the assumption that \(\mathsf{NP}\) does not have quasipolynomial-time algorithms. Some related hardness of approximation results are established, e.g., for the edge and vertex-connectivity augmention problems.
@article {KKL04, AUTHOR = {Kortsarz, Guy and Krauthgamer, Robert and Lee, James R.}, TITLE = {Hardness of approximation for vertex-connectivity network design problems}, JOURNAL = {SIAM J. Comput.}, FJOURNAL = {SIAM Journal on Computing}, VOLUME = {33}, YEAR = {2004}, NUMBER = {3}, PAGES = {704--720}, }