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}
}
  • Y. Bartal, A. Blum, +1 author A. Tomkins
  • Published in STOC '97 1997
  • Mathematics, Computer Science
  • 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
    97 Citations
    Towards the randomized k-server conjecture: a primal-dual approach
    • 32
    • Highly Influenced
    • PDF
    Metrical Task Systems and the k-Server Problem on HSTs
    • 19
    • Highly Influenced
    • PDF
    Finely-competitive paging
    • A. Blum, C. Burch, A. Kalai
    • 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
    • 88
    • PDF
    A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems
    • 47
    A Polylogarithmic-Competitive Algorithm for the k-Server Problem
    • 19
    • PDF
    Unfair Problems and Randomized Algorithms for Metrical Task Systems
    • S. Seiden
    • Mathematics, Computer Science
    • Inf. Comput.
    • 1999
    • 22
    • PDF
    Approximating a finite metric by a small number of tree metrics
    • 207
    • PDF
    A randomized on-line algorithm for the k-server problem on a line
    • 19
    • PDF
    A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
    • 27

    References

    Manuscript
    • April
    • 1996