Probabilistic embeddings of bounded genus graphs into planar graphs

A probabilistic C-embedding of a (guest) metric M into a collection of(host) metrics M'1, ..., M'k is a randomized mapping F of M intoone of the M'1, ..., M'k such that, for any two points p,q in theguest metric: The distance between F(p) and F(q) in any M'i is not smaller thanthe original distance between p and q. The expected distance between F(p) and F(q) in (random) M'i is notgreater than some constant C times the original distance, for C≥ 1. The constant C is called the distortion of the embedding. Low-distortion probabilistic embeddings enable reducing algorithmicproblems over "hard" guest metrics into "easy" host metrics.We show that every metric induced by a graph of bounded genus can beprobabilistically embedded into planar graphs, with constant distortion. The embedding can be computed efficiently, given a drawing of the graphon a genus-g surface.

[1]  Shang-Hua Teng,et al.  Lower-stretch spanning trees , 2004, STOC '05.

[2]  Ashish Goel,et al.  Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families , 2004, ESA.

[3]  Robert Krauthgamer,et al.  Measured Descent: A New Embedding Method for Finite Metrics , 2004, FOCS.

[4]  Anupam Gupta,et al.  Cuts, Trees and ℓ1-Embeddings of Graphs* , 2004, Comb..

[5]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[6]  Ran Raz,et al.  Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs , 1998, Discret. Comput. Geom..

[7]  Piotr Indyk,et al.  Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[8]  Carsten Thomassen,et al.  Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

[9]  David Peleg,et al.  A tight upper bound on the probabilistic embedding of series-parallel graphs , 2006, SODA 2006.

[10]  Noga Alon,et al.  A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) , 1991, On-Line Algorithms.

[11]  Anupam Gupta,et al.  Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.

[12]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[14]  Michael O. Albertson,et al.  On the independence ratio of a graph , 1978, J. Graph Theory.

[15]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[16]  H. Sachs,et al.  Regukre Graphen gegebener Taillenweite mit minimaler Knotenzahl , 1963 .

[17]  Kunal Talwar,et al.  Bypassing the embedding: algorithms for low dimensional metrics , 2004, STOC '04.

[18]  Erin W. Chambers,et al.  Multiple source shortest paths in a genus g graph , 2007, SODA '07.

[19]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[20]  Anupam Gupta,et al.  Steiner points in tree metrics don't (really) help , 2001, SODA '01.

[21]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.