Cuts, Trees and ℓ1-Embeddings of Graphs*

@article{Gupta2004CutsTA,
  title={Cuts, Trees and ℓ1-Embeddings of Graphs*},
  author={Anupam Gupta and Ilan Newman and Yuri Rabinovich and Alistair Sinclair},
  journal={Combinatorica},
  year={2004},
  volume={24},
  pages={233-269}
}
Motivated by many recent algorithmic applications, this paper aims to promote a systematic study of the relationship between the topology of a graph and the metric distortion incurred when the graph is embedded into ℓ1 space. The main results are:1. Explicit constant-distortion embeddings of all series-parallel graphs, and all graphs with bounded Euler number. These are the first natural families known to have constant distortion (strictly greater than 1). Using the above embeddings, algorithms… Expand
Embedding k-outerplanar graphs into ℓ1
TLDR
It is shown that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion, and hence also embedded into l1 with constant distort, implying a constant upper bound on the ratio between the sparsest cut and the maximum concurrent flow in multicommodity networks for k- outerplanar graphs. Expand
D-width, metric embedding, and their connections
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding good approximation algorithms for several problems. In particular, embedding to an e1 norm has beenExpand
Distortion of embeddings of binary trees into diamond graphs
Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families ofExpand
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees
  • Y. Emek
  • Mathematics, Computer Science
  • Algorithmica
  • 2010
TLDR
It is shown that every k- outerplanar multigraph admits a spanning tree with constant average stretch, which immediately translates to a constant bound on the distortion of probabilistically embedding k-outerplanar graphs into their spanning trees. Expand
Embeddings of Planar Quasimetrics into Directed 𝓁1 and Polylogarithmic Approximation for Directed Sparsest-Cut
TLDR
It is shown that the multicommodity flow-cut gap on directed planar graphs is O(log n), the first sub-polynomial bound for any family of directed graphs of super-constant treewidth, and the first polynomial-time polylogarithmicapproximation algorithms for the Directed Non-Bipartite Sparsest-Cut and Directed Multicut problems are obtained. Expand
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
TLDR
It is shown that series-parallel metrics have Markov type 2, which generalizes a result of Naor, Peres, Schramm, and Sheffield for trees and yields an O(√log n) approximation algorithm for vertex sparsestcut in such graphs, as well as an O(*log k) approximate max-flow/min-vertex-cut theorem for series- parallel instances with<i>k</i> terminals. Expand
Plane embeddings of planar graph metrics
TLDR
It is proved that all outerplanar graph metrics can be embedded into the plane with O(√n) distortion, generalizing the previous results on trees (both the worst-case bound and the approximation algorithm) and building techniques for handling cycles in plane embeddings of graph metrics. Expand
Metric embedding via shortest path decompositions
TLDR
The main result is an O(kmin{1p,12})-distortion embedding, which is a super-exponential improvement over the best previous bound of Lee and Sidiropoulos and implies improved distortion on bounded treewidth graphs (O((klogn)1p)). Expand
Plane Embeddings of Planar Graph Metrics
TLDR
It is proved that all outerplanar graph metrics can be embedded into the plane with $O(\sqrt n)$ distortion, generalizing the previous results on trees (both the worst-case bound and the approximation algorithm) and building techniques for handling cycles in plane embeddings of graph metrics. Expand
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced our understandingExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs
TLDR
It is shown that the metric space induced by an unweighted graph H of girth g cannot be embedded in a graph G (even if it is weighted) of smaller Euler characteristic, with distortion less than g/4 - 3/2 . Expand
The geometry of graphs and some of its algorithmic applications
TLDR
Efficient algorithms for embedding graphs low-dimensionally with a small distortion, and a new deterministic polynomial-time algorithm that finds a (nearly tight) cut meeting this bound. Expand
On approximating planar metrics by tree metrics
TLDR
The main ingredient of the proof is that weak probabilistic partitions suffice for the construction of tree metrics with low distortion, in contrast to strong partitions used by Bartal, and the result is the best possible by providing a lower bound of �( log diam G) for the distortion of any probabilistically approximation of the square grid by tree metrics. Expand
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon theExpand
Approximating a finite metric by a small number of tree metrics
TLDR
This paper derandomizes the use of Bartal's algorithm and obtains the first deterministic approximation algorithms for buy-at-bulk network design and vehicle routing and a novel view of probabilistic approximation of metric spaces as a deterministic optimization problem via linear programming. Expand
Approximating the bandwidth via volume respecting embeddings (extended abstract)
  • U. Feige
  • Mathematics, Computer Science
  • STOC '98
  • 1998
TLDR
A randomized algorithm is presented that runs in nearly linear time and outputs a linear arrangement whose band-widt,h is within a polylogarithmic multiplicative factor of optimal. Expand
Approximating the Bandwidth via Volume Respecting Embeddings
  • U. Feige
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2000
TLDR
A randomized algorithm that runs in nearly linear time and outputs a linear arrangement whose bandwidth is within a polylogarithmic multiplicative factor of optimal, based on a new notion, called volume respecting embeddings. Expand
Small distortion and volume preserving embeddings for planar and Euclidean metrics
  • Satish Rao
  • Computer Science, Mathematics
  • SCG '99
  • 1999
TLDR
The results give improvements for Feige's and Vempala’s approximation algorithms for planar and Euclidean metrics and an improved bound for volume respecting embeddings for Euclidan metrics. Expand
Excluded minors, network decomposition, and multicommodity flow
In this paper we show that, given a graph and parameters 6 and r, we can find either a K,,. minor or an edge-cut of size O(mT/6) whose removal yields components of weak diameter O(T-26); i.e., everyExpand
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
TLDR
This work presents a general framework for derandomizing approximation algorithms which use the above t.ree construction as a primitive and obtains the first deterministic approximation algorithms for these problems which match t,he best known randomized approsimations. Expand
...
1
2
3
4
5
...