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

doi:10.1109/SFCS.2001.959914

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

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	396-405
Number of pages	10
Journal	Annual Symposium on Foundations of Computer Science - Proceedings
DOIs	https://doi.org/10.1109/SFCS.2001.959914
State	Published - 2001

Access to Document

10.1109/SFCS.2001.959914

Cite this

@article{73a5cd4d14b6456abc11f70ff1b51d50,

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

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.",

author = "Yair Bartal and B{\'e}la Bollob{\'a}s and Manor Mendel",

year = "2001",

doi = "10.1109/SFCS.2001.959914",

language = "אנגלית",

pages = "396--405",

journal = "Annual Symposium on Foundations of Computer Science - Proceedings",

issn = "0272-5428",

}

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

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 -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this