TY - JOUR

T1 - A Ramsey-type theorem for metric spaces and its applications for Metrical Task Systems and related problems

AU - Bartal, Yair

AU - Bollobás, Béla

AU - Mendel, Manor

N1 - Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.

PY - 2001

Y1 - 2001

N2 - This paper gives a nearly logarithmic lower bound on the randomized competitive ratio for the Metrical Task Systems model. 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). This theorem may be of independent interest.

AB - This paper gives a nearly logarithmic lower bound on the randomized competitive ratio for the Metrical Task Systems model. 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). This theorem may be of independent interest.

UR - http://www.scopus.com/inward/record.url?scp=0035186676&partnerID=8YFLogxK

U2 - 10.1109/SFCS.2001.959914

DO - 10.1109/SFCS.2001.959914

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035186676

SN - 0272-5428

SP - 396

EP - 405

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

ER -