On metric Ramsey-type phenomena

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 463-472

  Bartal, Yair ^a   Linial, Nathan ^a   Mendel, Manor ^a   Naor, Assaf ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Dvoretzky theorem; Finite metric spaces; Ramsey theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; THEOREM PROVING;

METRIC SPACES;

GRAPH THEORY;

EID: 0038446933     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780610     Document Type: Conference Paper

References (26)

1. N. Alon and F. R. K. Chung. Explicit construction of linear sized tolerant networks. In Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), volume 72, pages 15-19, 1988.
2. K. Ball. Markov chains, Riesz transforms and Lipschitz maps. Geom. Fund. Anal., 2(2):137-172, 1992.
3. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, pages 184-193. 1996.
4. Y. Bartal. On approximating arbitrary metrics by tree metrics. In the 30th Annual ACM Symposium on Theory of Computing, pages 183-193, 1998.
5. Y. Bartal, B. Bollobás, and M. Mendel. Ramsey-type theorems for metric spaces with applications to online problems. In the 42nd Annual Symposium on Foundations of Computer Science, 2001.
6. Y. Bartal and M. Mendel. Multi-embeddings and path-approximation of metric spaces. In 14th Ann. ACM-SIAM Symposium on Discrete Algorithms, 2003.
7. A. Blum, H. Karloff, Y. Rabani, and M. Saks. A decomposition theorem for task systems and bounds for randomized server problems. SIAM J. Comput., 30(5):1624-1661 (electronic), 2000.
8. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. J. Assoc. Comput. Mach., 39(4):745-763, 1992.
9. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
10. J. Bourgain, T. Figiel, and V. Milman. On Hilbertian subsets of finite metric spaces. Israel J. Math., 55(2):147-152, 1986.
11. J. Bourgain, V. Milman, and H. Wolfson. On type of metric spaces. Trans. Amer. Math. Soc., 294(1):295-317, 1986.
12. F. R. K. Chung. Diameters and eigenvalues. J. Amer. Math. Soc., 2(2):187-196, 1989.
13. A. Dvoretzky. Some results on convex bodies and Banach spaces. In Proc. Internat. Sympos. Linear Spaces (Jerusalem, 1960), pages 123-160. Jerusalem Academic Press, Jerusalem, 1961.
14. p-spaces. Ark. Mat., 8:103-105 (1969), 1969.
15. R. L. Graham, B. L. Rothschild, and J. H. Spencer. Ramsey theory. John Wiley & Sons Inc., New York, second edition, 1990.
16. E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability. In 35th Annual ACM Symposium on Theory of Computing, 2003.
17. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In the 42nd Annual Symposium on Foundations of Computer Science, pages 10-33, 2001.
18. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (1982), pages 189-206. AMS, 1984.
19. H. Karloff, Y. Rabani, and Y. Ravid. Lower bounds for randomized k-server and motion-planning algorithms. SIAM J. Comput., 23(2):293-312, 1994.
20. I. Krasikov and S. Litsyn. On binary krawtchouk polynomials. In Codes and Association Schemes, volume 56 of AMS-DIMACS Volume series, pages 199-212. AMS, 2001.
21. A. J. Lemin. Isometric embedding of ultrametric (non-Archimedean) spaces in Hilbert space and Lebesgue space. In p-adic functional analysis (Ioannina, 2000), volume 222 of Lecture Notes in Pure and Appl. Math., pages 203-218. Dekker, New York, 2001.
22. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
23. N. Linial, A. Magen, and A. Naor. Girth and euclidean distortion. Geometric and Functional Analysis, 12(2):380-394, 2002.
24. M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive algorithms for server problems, J. Algorithms, 11(2):208-230, 1990.
25. p spaces. Israel J. Math., 102:189-197, 1997.
26. A. Nilli. On the second eigenvalue of a graph. Discrete Math., 91(2):207-210, 1991.