Lower bounds for embedding into distributions over excluded minor graph families

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 146-156

  Carroll, Douglas E ^a,b   Goel, Ashish ^a,b  

^a Engineering IV   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

EMBEDDINGS; EXCLUDED-MINORS; EXPANDER GRAPHS; FINITE METRICS; LOWER BOUNDS; PLANAR GRAPH; TREE METRICS; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 35048833270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_15     Document Type: Article

References (16)

1. N. Alon, R. Karp, D. Peleg, and D. West, "A Graph-Theoretic Game and its Application to the k-Server Problem", SJAM J. CompuL, 24:1 (1998), pp. 78-100.
2. Y. Bartal, "Probabilistic approximation of metric spaces and its algorithmic applications", In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 184-193.
3. Y. Bartal, "On approximating arbitrary metrics by tree metrics", In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 161-168.
4. B. Baker, "Approximation Algorithms for NP-complete Problems on Planar Graphs", J. ACM, 41 (1994), pp. 153-180.
5. H. Bodlaender, "A partial k-arboretum of graphs with bounded treewidth", Theoretical Computer Science, 209 (1998), pp. 1-45.
6. R. Diestel, "Graph Theory", Springer-Verlag, New York, 1997.
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, 2003, pp. 448-455.
8. 1-embeddings.", In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 399-408.
9. 1" In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 527-536.
10. M. Imase and B. Waxman, "Dynamic Steiner Tree Problem.", SIAM J. Discrete Math., 4 (1991), pp. 369-384.
11. P. Klein, S. Plotkin, and S. Rao, "Excluded Minors, Network Decomposition, and Multicommodity Flow", In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 682-690.
12. T. Kloks, "Treewidth: Computations and Approximations", Lecture Notes in Computer Science, Vol. 842, Springer-Verlag, Berlin, 1994.
13. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications", Combinatorica, 15 (1995), pp. 215-245.
14. 1", In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 456-462.
15. Y. Rabinovich and R. Raz, "Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs", Discrete & Computational Geometry, 19 (1998), pp. 79-94.
16. S. Rao, "Small distortion and volume preserving embeddings for Planar and Euclidean metrics", In Proceedings of the 15th Annual Symposium on Computational Geometry, 1999, pp. 300-306.