Optimal Stochastic Planarization

It has been shown by Indyk and Sidiropoulos \cite{indyk_genus} that any graph of genus $g>0$ can be stochastically embedded into a distribution over planar graphs with distortion $2^{O(g)}$. This bound was later improved to $O(g^2)$ by Borradaile, Lee and Sidiropoulos \cite{BLS09}. We give an embedding with distortion $O(\log g)$, which is asymptotically optimal. Apart from the improved distortion, another advantage of our embedding is that it can be computed in polynomial time. In contrast, the algorithm of \cite{BLS09} requires solving an NP-hard problem. Our result implies in particular a reduction for a large class of geometric optimization problems from instances on genus-$g$ graphs, to corresponding ones on planar graphs, with a $O(\log g)$ loss factor in the approximation guarantee.

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

[2]  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).

[3]  Francis Lazarus,et al.  Optimal System of Loops on an Orientable Surface , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[4]  Anupam Gupta,et al.  Cuts, Trees and ℓ1-Embeddings of Graphs* , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[6]  Erin W. Chambers,et al.  Homology flows, cohomology cuts , 2009, STOC '09.

[7]  Jeff Erickson,et al.  Greedy optimal homotopy and homology generators , 2005, SODA '05.

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

[9]  Glencora Borradaile,et al.  Randomly removing g handles at once , 2009, SCG '09.

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

[11]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[12]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[13]  Piotr Indyk,et al.  Probabilistic embeddings of bounded genus graphs into planar graphs , 2007, SCG '07.

[14]  James R. Lee,et al.  Genus and the geometry of the cut graph , 2010, SODA '10.

[15]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[16]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[17]  Satish Rao,et al.  Small distortion and volume preserving embeddings for planar and Euclidean metrics , 1999, SCG '99.

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

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

[20]  James R. Lee,et al.  On the geometry of graphs with a forbidden minor , 2009, STOC '09.