A polylog(n)-Competitive Algorithm for Metrical Task Systems

@inproceedings{Bartal1997APA,
  title={A polylog(n)-Competitive Algorithm for Metrical Task Systems},
  author={Yair Bartal and Avrim Blum and Carl Burch and Andrew Tomkins},
  booktitle={STOC},
  year={1997}
}
We present a randomized on-line algorithm for the Metrical Task System problem that achieves a competitive ratio of for arbitrary metric spaces, against an oblivious adversary. This is the first algorithm to achieve a sublinear competitive ratio for all metric spaces. Our algorithm uses a recent result of Bartal [Bar96] that an arbitrary metric space can be probabilistically approximated by a set of metric spaces called “ -hierarchical well-separated trees” ( HST’s). Indeed, the main technical… CONTINUE READING

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…