TY - GEN

T1 - Better algorithms for unfair metrical task systems and applications

AU - Fiat, Amos

AU - Mendel, Manor

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

PY - 2000

Y1 - 2000

N2 - 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).

AB - 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).

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

U2 - 10.1145/335305.335408

DO - 10.1145/335305.335408

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0033718004

SN - 1581131844

SN - 9781581131840

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 725

EP - 734

BT - Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000

T2 - 32nd Annual ACM Symposium on Theory of Computing, STOC 2000

Y2 - 21 May 2000 through 23 May 2000

ER -