A polylog(n)-competitive algorithm for metrical task systems
@inproceedings{Bartal1997APA, title={A polylog(n)-competitive algorithm for metrical task systems}, author={Y. Bartal and A. Blum and C. Burch and A. Tomkins}, booktitle={STOC '97}, year={1997} }
We present a randomized on-line algorithm for the Metrical Task System problem that achieves a competitive ratio of O(log6 n) for arbitrary metric spaces, against an oblivious adversary. This is the first algorithm to achieve a sublinear competitive ratio for all metric spaces. Our algorit hm uses a recent result of Bartal [Bar96] that an arbitrary metr ic space can be probabilistically approximated by a set of metric spaces called “ k-hierarchical well-separated trees” ( kHST’s). Indeed, the… CONTINUE READING
Topics from this paper
97 Citations
Towards the randomized k-server conjecture: a primal-dual approach
- Mathematics, Computer Science
- SODA '10
- 2010
- 32
- Highly Influenced
- PDF
Metrical Task Systems and the k-Server Problem on HSTs
- Mathematics, Computer Science
- ICALP
- 2010
- 19
- Highly Influenced
- PDF
Finely-competitive paging
- Computer Science
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- 1999
- 53
- PDF
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- Mathematics, Computer Science
- 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
- 2011
- 88
- PDF
A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems
- Computer Science
- Proceedings 2001 IEEE International Conference on Cluster Computing
- 2001
- 47
Unfair Problems and Randomized Algorithms for Metrical Task Systems
- Mathematics, Computer Science
- Inf. Comput.
- 1999
- 22
- PDF
Approximating a finite metric by a small number of tree metrics
- Mathematics, Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998
- 207
- PDF
A randomized on-line algorithm for the k-server problem on a line
- Computer Science
- Random Struct. Algorithms
- 2006
- 19
- PDF
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
- Mathematics, Computer Science
- SIAM J. Comput.
- 2000
- 27
References
Manuscript
- April
- 1996