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