Better algorithms for unfair metrical task systems and applications

Amos Fiat, Manor Mendel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain the following results: 1. Better randomized algorithms for unfair metrical task systems on the uniform metric space. 2. Better randomized algorithms for metrical task systems on general metric spaces, O(log2 n(log log n)2) competitive, improving on the best previous result of O(log5 n log log n). 3. A tight randomized competitive ratio for the k-weighted caching problem on k+1 points, O(log k), improving on the best previous result of O(log2 k).

Original languageEnglish
Title of host publicationProceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Pages725-734
Number of pages10
DOIs
StatePublished - 2000
Event32nd Annual ACM Symposium on Theory of Computing, STOC 2000 - Portland, OR, United States
Duration: 21 May 200023 May 2000

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Country/TerritoryUnited States
CityPortland, OR
Period21/05/0023/05/00

Cite this