On the geometry of graphs with a forbidden minor

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 245-254

  Lee, James R ^a   Sidiropoulos, Anastasios ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Embeddings; Forbidden minors; Geometry of graphs

Indexed keywords

CONSTANT FACTOR APPROXIMATION; EMBEDDINGS; FORBIDDEN MINORS; METRIC SPACES; MULTI-COMMODITY; PATHWIDTH; PLANAR GRAPH; SIMPLE STRUCTURES; SPARSEST CUT; TOPOLOGICAL REDUCTION; TOPOLOGICAL SIMPLIFICATION; TREE-WIDTH;

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; METRIC SYSTEM; SET THEORY;

GRAPH THEORY;

EID: 70350683776     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536450     Document Type: Conference Paper

References (26)

1. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-ow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301 (electronic), 1998.
2. Y. Bartal. Probabilistic approximations of metric space and its algorithmic application. In 37th Annual Symposium on Foundations of Computer Science, pages 183-193, Oct. 1996.
3. Y. Bartal. On approximating arbitrary metrics by tree metrics. In 30th Annual ACM Symposium on Theory of Computing, pages 183-193, 1998.
4. D. Carroll and A. Goel. Lower bounds for embedding into distributions over excluded minor graph families. In Proceedings of the 12th European Symposium on Algorithms, 2004.
5. A. Chakrabarti, A. Jaffe, J. R. Lee, and J. Vincent. Embeddings of topological graphs: Lossy invariants, linearization, and 2-sums. In IEEE Symposium on Foundations of Computer Science, 2008.
6. C. Chekuri, A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Embedding k-outerplanar graphs into l1. SIAM J. Discrete Math., 20(1):119-136 (electronic), 2006.
7. M. M. Deza and M. Laurent. Geometry of cuts and metrics, volume 15 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1997.
8. R. Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 2005.
9. 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.
10. 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.
11. A. Gupta, I. Newman, Y. Rabinovich, and A. Sinclair. Cuts, trees and l1-embeddings of graphs. Combinatorica, 24(2):233{269, 2004.
12. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual Symposium on Foundations of Computer Science, pages 10-33. IEEE Computer Society, 2001.
13. 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.
14. 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.
15. J. R. Lee and A. Naor. Extending Lipschitz functions via random metric partitions. Invent. Math., 160(1):59-95, 2005.
16. J. R. Lee and P. Rhagevendra. Coarse differentiation and multi-flows in planar graphs. 2007.
17. T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
18. N. Linial. Finite metric-spaces-combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002), pages 573-586, Beijing, 2002. Higher Ed. Press.
19. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
20. L. Lovász. Graph minor theory. Bull. Amer. Math. Soc. (N.S.), 43(1):75-86 (electronic), 2006.
21. J. Matoušek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
22. H. Okamura and P. D. Seymour. Multicommodity flows in planar graphs. J. Combin. Theory Ser. B, 31(1):75-81, 1981.
23. Y. Rabinovich and R. Raz. Lower bounds on the distortion of embedding finite metric spaces in graphs. Discrete Comput. Geom., 19(1):79-94, 1998.
24. 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.
25. N. Robertson and P. Seymour. Graph minors XVII. Taming a vortex. (77):162-210, 1999.
26. N. Robertson and P. D. Seymour. Graph minors. I. Excluding a forest. J. Combin. Theory Ser. B, 35(1):39-61, 1983.