This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
42nd IEEE symposium on Foundations of Computer Science (FOCS?01)
A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems
Las Vegas, Nevada
October 14-October 17
ISBN: 0-7695-1390-5
This paper gives a nearly logarithmic lower bound on the randomized competitive ratio for the Metrical Task Systems model [9]. This implies a similar lower bound for the extensively studied K-server problem. Our proof is based on proving a Ramsey-type theorem for metric spaces. In particular we prove that in every metric space there exists a large subspace which is approximately a "hierarchically well-separated tree" (HST) [3]. This theorem may be of independent interest.
Citation:
Y. Barta, B. Bollobás, M. Mendel, "A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems," focs, pp.396, 42nd IEEE symposium on Foundations of Computer Science (FOCS?01), 2001
Usage of this product signifies your acceptance of the Terms of Use.