The Community for Technology Leaders
RSS Icon
Subscribe
Las Vegas, Nevada
Oct. 14, 2001 to Oct. 17, 2001
ISBN: 0-7695-1390-5
pp: 396
ABSTRACT
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, 2001, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2001, pp. 396, doi:10.1109/SFCS.2001.959914
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool