Randomly removing g handles at once

It was shown in [Indyk-Sidiropoulos 07] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g-1 with constant distortion. Removing handles one by one gives an embedding into a distribution over planar graphs with distortion 2O(g). By removing all $g$ handles at once, we present a probabilistic embedding with distortion O(g2) for both orientable and non-orientable graphs. Our result is obtained by showing that the minimum-cut graph of [Erickson-HarPeled 04] has low dilation, and then randomly cutting this graph out of the surface using the Peeling Lemma from [Lee-Sidiropoulos 08].

[1]  G. Borradaile,et al.  Exploiting Planarity for Network Flow and Connectivity Problems , 2008 .

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

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

[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]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

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

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

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

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

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

[11]  Kunal Talwar,et al.  An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor , 2003, RANDOM-APPROX.

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

[13]  James R. Lee,et al.  Extending Lipschitz functions via random metric partitions , 2005 .

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

[15]  Trish Groves,et al.  Cuts , 2010, BMJ : British Medical Journal.

[16]  Jeff Erickson,et al.  Optimally Cutting a Surface into a Disk , 2002, SCG '02.

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

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