A tight threshold for metric Ramsey phenomena
暂无分享,去创建一个
[1] J. Matousek,et al. On embedding expanders into ℓp spaces , 1997 .
[2] Béla Bollobás,et al. Ramsey-type theorems for metric spaces with applications to online problems , 2004, J. Comput. Syst. Sci..
[3] Jirí Matousek,et al. Low-Distortion Embeddings of Finite Metric Spaces , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[4] Nathan Linial,et al. On metric ramsey-type phenomena , 2003, STOC '03.
[5] BartalYair,et al. Ramsey-type theorems for metric spaces with applications to online problems , 2006 .
[6] Yuval Rabani,et al. Lower Bounds for Randomized k-Server and Motion-Planning Algorithms , 1994, SIAM J. Comput..
[7] Jean Bourgain,et al. On hilbertian subsets of finite metric spaces , 1986 .
[8] Yuval Rabani,et al. Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.
[9] Yuval Rabani,et al. A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems , 2000, SIAM J. Comput..
[10] Nathan Linial,et al. Some Low Distortion Metric Ramsey Problems , 2005, Discret. Comput. Geom..
[11] Nathan Linial. Finite metric spaces: combinatorics, geometry and algorithms , 2002, SCG '02.