Ramsey-type theorems for metric spaces with applications to online problems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type theorems for metric spaces, that state that every metric space contains a large subspace which is approximately a hierarchically well-separated tree (and in particular an ultrametric). These Ramsey-type theorems may be of independent interest.
Fix an error in the metadata. 31 pages, 0 figures. Preliminary version in FOCS '01. To be published in J. Comput. System Sci

Keywords

Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/98356

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0406028
 http://arxiv.org/abs/cs/0406028
 J. Comput. System Sci. 72(5):890-921, 2006
 doi:10.1016/j.jcss.2005.05.008

Collections

arXiv