Publications

Home   |   Publications   |   tcsmath   [old]
Home   |   Publications   |   tcsmath   [old]

[multiflows]

[ abs | bib ]   Flow-cut gaps and face covers in planar graphs, with R. Krauthgamer and H. Rika (SODA'19)

We establish new and improved bounds on the flow-cut gap in planar flow networks where the terminals lie on a small number of faces. The classical Okamura-Seymour theorem (1981) shows that when all terminals lie on a single face, the flow-cut gap is exactly 1. We show that if the terminals lie on $\gamma$ faces, the flow-cut gap is $O(\log \gamma)$. This is proved by embedding the terminal metric into a distribution over trees with distortion $O(\log \gamma)$, which is tight up to the implied constant factor.

@inproceedings{KLR19,
     AUTHOR = {Krauthgamer, Robert and Lee, James R. and Rika, Havana},
  BOOKTITLE = {Proceedings of the {T}hirtieth {A}nnual {ACM}-{SIAM} {S}ymposium on
                  {D}iscrete {A}lgorithms},
      PAGES = {525--534},
  PUBLISHER = {SIAM, Philadelphia, PA},
      TITLE = {Flow-cut gaps and face covers in planar graphs},
       YEAR = {2019}
}
[ abs | bib ]   Separators in region intersection graphs (ITCS'17)

A region intersection graph over a base graph \(G_0\) is a graph \(G\) whose vertices correspond to connected subsets of \(G_0\) with an edge between two vertices if the corresponding regions intersect. We show that if \(G_0\) excludes the complete graph \(K_h\) as a minor, then every region intersection graph over \(G_0\) with m edges has a balanced separator with \(O(\sqrt{m})\) nodes. If \(G\) has uniformly bounded vertex degrees, we show the separator is found by spectral partitioning.

A string graph is the intersection graph of continuous arcs in the plane. The preceding result implies that every string graph with m edges has a balanced separator of size \(O(\sqrt{m})\). This bound is optimal, as it generalizes the planar separator theorem. It confirms a conjecture of Fox and Pach (2010) and improves over the \(O(\sqrt{m} \log m)\) bound of Matousek (2013).

@inproceedings{LeeStrings17,
    author    = {James R. Lee},
    title     = {Separators in Region Intersection Graphs},
    booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
    2017, January 9-11, 2017, Berkeley, CA, {USA}},
    pages     = {1:1--1:8},
    year      = {2017},
}
[ abs | bib ]   A node-capacitated Okamura-Seymour theorem, with M. Mendel and M. Moharrami (STOC'13; Math. Prog. Ser. A.)

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},
}
[ abs | bib ]   On the 2-sum embedding conjecture, with D. E. Poore (SoCG'13)

The $2$-sum embedding conjecture (Lee-Sidiropoulos, FOCS 2009) states that all the shortest-path metrics supported on a family of graphs $\mathcal F$ admit a uniformly bi-Lipschitz embedding into $L_1$ if and only if the same property holds for the closure of $\mathcal F$ under edge sums. The problem has an equivalent formulation in terms of multi-commodity flow/cut gaps and appears to be a fundamental step in resolving the well-studied question of which families of graphs admit an approximate multi-commodity max-flow/min-cut theorem.

The $2$-sum conjecture is known to be true when $\mathcal F = {K_3}$, where $K_n$ denotes the complete graph on $n$ vertices; this is equivalent to the seminal result of Gupta, Newman, Rabinovich, and Sinclair (Combinatorica, 2004) on embeddings of series-parallel graphs into $L_1$. For $\mathcal F = {K_4}$, the conjecture was confirmed by Chakrabarti, Jaffe, Lee, and Vincent (FOCS 2008). In the present paper, we prove the conjecture holds for any finite family of graphs $\mathcal F$. In fact, we obtain a quantitatively optimal result: Any path metric on a graph formed by $2$-sums of arbitrarily many copies of $K_n$ embeds into $L_1$ with distortion $O(\log n)$. This is a consequence of a more general theorem that characterizes the $L_1$ distortion of the 2-sum closure of any family $\mathcal F$ in terms of constrained embeddings of the members of $\mathcal F$.

@inproceedings{LeePoore13,
  author    = {James R. Lee and
               Daniel E. Poore},
  title     = {On the 2-sum embedding conjecture},
  booktitle = {Symposuim on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
               Brazil, June 17-20, 2013},
  pages     = {197--206},
  year      = {2013},
}
[ abs | bib ]   Near-optimal bounds for embedding doubling spaces into $L_1$, with A. Sidiropoulos (STOC'11)

We show that there is a family of $n$-point uniformly doubling metrics that require bilipschitz distortion $\Omega\left(\sqrt{\frac{\log n}{\log \log n}}\right)$ under any embedding into $L_1$, matching the known upper bound to within an $O(\sqrt{\log \log n})$ factor.

@inproceedings{DBLP:conf/stoc/LeeS11,
  author    = {James R. Lee and
               Anastasios Sidiropoulos},
  title     = {Near-optimal distortion bounds for embedding doubling spaces into
               L\({}_{\mbox{1}}\)},
  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  pages     = {765--772},
  year      = {2011},
}
[ abs | bib ]   Bilipschitz snowflakes and metrics of negative type, with M. Moharrami (STOC'10)

We show there exists a metric space $(X,d)$ such that $(X,\sqrt{d})$ admits a bilipschitz embedding into $L_2$, but $(X,d)$ does not admit an equivalent metric of negative type. In fact, we exhibit a strong quantitative bound: There are $n$-point subsets $Y_n \subseteq X$ such that any mapping of $(Y_n,d)$ to a metric of negative type incurs distortion at least $\tilde{\Omega}(\log n)^{1/4}$.

This answers an open question about the strength of strong vs. weak triangle inequalities in a number of semidefinite programs. Our construction sheds light on the power of various notions of “dual flows” that arise in algorithms for approximating the Sparsest Cut problem. It also has other interesting implications for bilipschitz embeddings of finite metric spaces.

@inproceedings{LMstoc10,
  author    = {James R. Lee and
               Mohammad Moharrami},
  editor    = {Leonard J. Schulman},
  title     = {Bilipschitz snowflakes and metrics of negative type},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {621--630},
  publisher = {{ACM}},
  year      = {2010},
}
[ abs | bib ]   Pathwidth, trees, and random embeddings, with A. Sidiropoulos (Combinatorica 2013)

We show that every graph of pathwidth $k$ embeds into a distribution over random trees with distortion $c(k)$. In particular, this implies that whenever a non-trivial minor-closed family $\mathcal{F}$ of graphs does not contain all trees, the multi-commodity max-flow/min-cut gap is uniformly bounded for all instances over $\mathcal{F}$.

@article{LS13,
     AUTHOR = {Lee, James R. and Sidiropoulos, Anastasios},
   FJOURNAL = {Combinatorica. An International Journal on Combinatorics and the
                  Theory of Computing},
    JOURNAL = {Combinatorica},
     NUMBER = {3},
      PAGES = {349--374},
      TITLE = {Pathwidth, trees, and random embeddings},
     VOLUME = {33},
       YEAR = {2013}
}
[ abs | bib ]   Genus and the geometry of the cut graph, with A. Sidiropoulos (SODA'10)

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},
}
[ abs | bib ]   Randomly removing $g$ handles at once, with G. Borradaile and A. Sidiropoulos (SoCG'09; CGTA)

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},
   FJOURNAL = {Computational Geometry. Theory and Applications},
    JOURNAL = {Comput. Geom.},
     NUMBER = {8},
      PAGES = {655--662},
      TITLE = {Randomly removing {$g$} handles at once},
     VOLUME = {43},
       YEAR = {2010}
}
[ abs | bib ]   Metric uniformization and spectral bounds for graphs, with J. A. Kelner, G. N. Price, and S.-H. Teng (STOC'09; GAFA)

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate “Riemannian” metric to uniformize the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatorics of special types of flows. This involves proving new inequalities on the crossing number of graphs.

We use our method to show that for any positive integer k, the kth smallest eigenvalue of the Laplacian on an n-vertex, bounded-degree planar graph is O(k/n). This bound is asymptotically tight for every k, as it is easily seen to be achieved for square planar grids. We also extend this spectral result to graphs with bounded genus, and graphs which forbid fixed minors. Previously, such spectral upper bounds were only known for the case k=2.

@article {KLPT11,
    AUTHOR = {Kelner, Jonathan A. and Lee, James R. and Price, Gregory N.
              and Teng, Shang-Hua},
     TITLE = {Metric uniformization and spectral bounds for graphs},
   JOURNAL = {Geom. Funct. Anal.},
  FJOURNAL = {Geometric and Functional Analysis},
    VOLUME = {21},
      YEAR = {2011},
    NUMBER = {5},
     PAGES = {1117--1143},
}
[ abs | bib ]   Eigenvalue bounds, spectral partitioning, and metrical deformations via flows, with P. Biswal and S. B. Rao (FOCS'08; JACM)

A method is presented for establishing an upper bound on the first non-trivial eigenvalue of the Laplacian of a finite graph. Our approach uses multi-commodity flows to deform the geometry of the graph, and the resulting metric is embedded into Euclidean space to recover a bound on the Rayleigh quotient.

Using this, we resolve positively a question of Spielman and Teng by proving that \(\lambda_2(G) \leq O(d h^6 \log h/n)\) whenever \(G\) is a \(K_h\)-minor-free graph with maximum degree \(d\). While the standard “sweep” algorithm applied to the second eigenvector of a graph my fail to find a good quotient cut in graphs of unbounded degree, the arguments here produce a vector that works for arbitrary graphs. This yields an alterante proof of the Alon-Seymour-Thomas theorem that every excluded-minor family of graphs has \(O(\sqrt{n})\)-node balanced separators.

Related: These methods are extended to higher eigenvalues in a joint work with Kelner, Price, and Teng.
Related: These method form the basis for the uniformization and heat kernel bounds in Conformal growth rates and spectral geometry on distributional limits of graphs.

@article {MR2665882,
    AUTHOR = {Biswal, Punyashloka and Lee, James R. and Rao, Satish},
     TITLE = {Eigenvalue bounds, spectral partitioning, and metrical
              deformations via flows},
   JOURNAL = {J. ACM},
  FJOURNAL = {Journal of the ACM},
    VOLUME = {57},
      YEAR = {2010},
    NUMBER = {3},
     PAGES = {Art. 13, 23},
}
[ abs | bib ]   Coarse differentiation and multi-flows in planar graphs, with P. Raghavendra (APPROX'07; DCG)

We establish that the multi-commodity max-flow/min-cut gap for series-parallel graphs is at least $2$. Our approach uses the coarse differentiation methodology of Eskin, Fisher, and Whyte.

@article {LR10,
    AUTHOR = {Lee, James R. and Raghavendra, Prasad},
     TITLE = {Coarse differentiation and multi-flows in planar graphs},
   JOURNAL = {Discrete Comput. Geom.},
  FJOURNAL = {Discrete \& Computational Geometry. An International Journal
              of Mathematics and Computer Science},
    VOLUME = {43},
      YEAR = {2010},
    NUMBER = {2},
     PAGES = {346--362},
}
[ abs | bib ]   Improved approximation algorithms for minimum-weight vertex separators, with M.-T. Hajiaghayi and U. Feige (STOC'05; SICOMP)

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},
}