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

Yair Bartal, Béla Bollobás, Manor Mendel

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

Abstract

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.

Original languageAmerican English
Pages (from-to)396-405
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
DOIs
StatePublished - 2001

Fingerprint

Dive into the research topics of 'A Ramsey-type theorem for metric spaces and its applications for Metrical Task Systems and related problems'. Together they form a unique fingerprint.

Cite this