Graph decomposition lemmas and their role in metric embedding methods

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

Volumn 3221, Issue , 2004, Pages 89-97

  Bartal, Yair ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

ALGORITHMIC APPLICATIONS; BASIC GRAPHS; EMBEDDING THEOREMS; GRAPH DECOMPOSITIONS; METRIC EMBEDDINGS; METRIC SPACES; UNDIRECTED GRAPH; UNIFIED FRAMEWORK;

ARTIFICIAL INTELLIGENCE;

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

References (19)

1. B. Awerbuch and Y. Azar. Buy-at-Bulk Network Design. In Free, 38th IEEE Symp. on Foundations of Computer Science, 542-547, 1997.
2. Y. Bartal, Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. In Proc. of the 37rd Ann. IEEE Symp. on Foundations of Computer Science, 184-193, 1996.
3. Y. Bartal, On Approximating Arbitrary Metrics by Tree Metrics. In Proc. of the 30th Ann. ACM Symp. on Theory of Computing, 161-168, 1998.
4. Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog(n)-Competitive Algorithm for Metrical Task Systems. In Proc. of the 29th Ann. ACM Symp. on Theory of Computing, 711-719, 1997.
5. Y. Bartal, M. Charikar, and D. Raz. Approximating Min-Sum Clustering in Metric Spaces. In Proc. of the 33rd Ann. ACM Symp. on Theory of Computing, 11-20, 2001.
6. Y. Bartal and M. Mendel. Multi-Embedding and Path Approximation of Metric Spaces. In Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms, 424-433, 2003.
7. Y. Bartal and M. Mendel. Dimension Reduction for ultrametrics. In Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms, 664-665, January 2004.
8. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics, IEEE Symposium on Foundations of Computer Science, 379-388, 1998.
9. G. Calinescu, H. Karloff, Y. Rabani. Approximation Algorithms for the 0-Extension Problem. In Proc. of the 12th ACM-SIAM Symp. on Discrete Algorithms, 8-16, 2001.
10. G. Even, J. Naor, S. Rao, and B. Scheiber. Divide-and-Conquer Approximation Algorithms via Spreading Metrics. In Proc. of the 36th Ann. IEEE Symp. on Foundations of Computer Science, 62-71, 1995.
11. Amos Fiat and Manor Mendel. Better Algorithms for Unfair Metrical Task Systems and Applications, In Proc. of the 32nd Annual ACM Symposium on Theory of Computing, 725-734, 2000.
12. J. Fakcharoenphol, C. Harrelson, S. Rao and K. Talwar. An Improved Approximation Algorithm for the 0-Extension Problem. In Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms, 257-265, 2003.
13. J. Fakcharoenphol, S. Rao and K. Talwar. A Tight bound on Approximating Arbitrary metrics by Tree metrics. In Proc. of the 35th Ann. ACM Symp. on Theory of Computing, 448-455, 2003.
14. N. Garg, G. Konjevod, and R. Ravi. A Polylogarithmic Algorithm for the Group Steiner Tree Problem. In Journal of Algorithms, 37(1):66-84, 2000.
15. N. Garg, V. Vazirani, and Y. Yannakakis. Approximate Max-Flow Min-(Multi) Cut Theorems and Their Applications. In SIAM J. Computing 25, 235-251, 1996.
16. P. Indyk. Algorithmic Applications of Low-Distortion Geometric Embeddings. In Proc. of 42nd Symposium on Foundations of Computer Science, 10-33, 2001.
17. J. M. Kleinberg and E. Tardos. Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. In Proc. of the 40th Ann. IEEE Symp. on Foundations of Computer Science, 14-23, 1999.
18. S. Rao and A. Richa. New Approximation Algorithms for some Ordering Problems. In Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, 211-219, 1998.
19. P.D. Seymour. Packing Directed Circuits Fractionally. In Combinatorica, 15(2):281-288, 1995.