Probabilistic embeddings of bounded genus graphs into planar graphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 204-209

  Indyk, Piotr ^a   Sidiropoulos, Anastasios ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bounded genus graphs; Embeddings; Planar graphs; Probabilistic approximation

Indexed keywords

PLANAR GRAPHS; PROBABILISTIC APPROXIMATION; PROBABILISTIC EMBEDDINGS;

APPROXIMATION THEORY; CONFORMAL MAPPING; NUMERICAL METHODS; PROBABILITY; PROBLEM SOLVING;

GRAPH THEORY;

EID: 35348925362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247107     Document Type: Conference Paper

References (23)

1. M. O. Albertson and J. P. Hutchinson. On the independence ratio of a graph. J. Graph Theory, 2:1-8, 1978.
2. N. Alon, R. Karp, D. Peleg, and D. B. West. Graph-theoretic game and its applications to the k-server problem. SIAM Journal on Computing, 1991.
3. B. S. Baker. Approximation algorithms for np-complete problems on planar graphs. J. ACM, 41(1):153-180, 1994.
4. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Annual Symposium on Foundations of Computer Science, 1996.
5. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Annual ACM Symposium on Theory of Computing, pages 183-193, 1998.
6. S. Cabello and E. Chambers. Multiple source shortest paths in a genus g graph. In SODA, 2007.
7. D. E. Carroll and A. Goel. Lower bounds for embedding into distributions over excluded minor graph families. In ESA, pages 146-156, 2004.
8. 1. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 527-536, 2003.
9. M. Elkin, Y. Emek, D. Spielman, and S.-H. Teng. Lower-stretch spanning trees. In Annual ACM Symposium on Theory of Computing, pages 494-503, 2005.
10. Y. Emek and D. Peleg. A tight upper bound on the probabilistic embedding of series-parallel graphs. In SODA, pages 1045-1053, 2006.
11. P. Erdos and H. Sachs. Reguläre graphen gegebener taillenweite mit minimaler knotenzahl. Wiss. Z. Matin-Luther- Univ. Halle- Wittenberg Math. -Natur. Reihe, 12:251-257, 1963.
12. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. Annual ACM Symposium on Theory of Computing, 2003.
13. A. Gupta. Steiner points in tree metrics don't (really) help. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 220-227, 2001.
14. A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Cuts, trees and 11 embeddings. Annual Symposium on Foundations of Computer Science, 1999.
15. P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. Annual Symposium on Foundations of Computer Science, 2001.
16. R. M. Karp. A 2k-competitive algorithm for the circle. Manuscript, 1989.
17. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal., 2004. To appear.
18. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
19. B. Mohar and C. Thomassen. Graphs on Surfaces. John Hopkins, 2001.
20. Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Computational Geometry, 1998.
21. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In Annual ACM Symposium on Theory of Computing, pages 281-290, 2004.
22. D. Thilikos. Personal Communication.
23. C. Thomassen. Embeddings of graphs with no short noncontractible cycles. J. Combin. Theory, Ser B, 48:155-177, 1990.