Randomly removing g handles at once

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2009, Pages 371-376

  Borradaile, Glencora ^a   Lee, James R ^b   Sidiropoulos, Anastasios ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

Bounded genus; Embeddings; Graphs; Planar graphs; Probablistic approximation

Indexed keywords

CONSTANT DISTORTION; EMBEDDINGS; ORIENTABLE; PLANAR GRAPH;

GRAPH THEORY;

COMPUTATIONAL GEOMETRY;

EID: 70849095485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542362.1542425     Document Type: Conference Paper

References (16)

1. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
2. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Annual Symposium on Foundations of Computer Science, 1996.
3. G. Borradaile. Exploiting Planarity for Network Flow and Connectivity Problems. PhD thesis, Brown University, 2008.
4. G. Borradaile, E. Demaine, and S. Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded genus graphs. In Proceedings of STACS, 2009.
5. D. E. Carroll and A. Goel. Lower bounds for embedding into distributions over excluded minor graph families. In ESA, pages 146-156, 2004.
6. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37-59, 2004.
7. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
8. J. Fakcharoenphol and K. Talwar. An improved decomposition theorem for graphs excluding a fixed minor. In Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization, volume 2764 of Lecture Notes in Computer Science, pages 36-46. Springer, 2003.
9. A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Cuts, trees and l1-embeddings of graphs. In 40 th Annual Symposium on Foundations of Computer Science, pages 399-408. IEEE Computer Soc., Los Alamitos, CA, 1999.
10. P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. Annual Symposium on Foundations of Computer Science, 2001.
11. P. Indyk and A. Sidiropoulos. Probabilistic embeddings of bounded genus graphs into planar graphs. In Proceedings of the 23rd Annual Symposium on Computational Geometry. ACM, 2007.
12. P. N. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 682-690, 1993.
13. J. R. Lee and A. Sidiropoulos. On the geometry of graphs with a forbidden minor. To appear, Proceddings of the 41st Annual ACM Symposium on the Theory of Computing, 2009.
14. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
15. B. Mohar and C. Thomassen. Graphs on Surfaces. John Hopkins, 2001.
16. S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 300-306, New York, 1999. ACM.