A polylogarithmic-competitive algorithm for the k-server problem

N. Bansal, N. Buchbinder, A. Madry, J. Naor

Research output: Contribution to journalArticleAcademicpeer-review

29 Citations (Scopus)

Abstract

We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log3 n log2 k) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [Koutsoupias and Papadimitriou 1995] for a wide range of n.
Original languageEnglish
Article number40
Pages (from-to)1-49
JournalJournal of the ACM
Volume62
Issue number5
DOIs
Publication statusPublished - Nov 2015

Keywords

  • Design
  • Algorithms
  • k-server problem
  • competitive analysis
  • randomization

Fingerprint

Dive into the research topics of 'A polylogarithmic-competitive algorithm for the k-server problem'. Together they form a unique fingerprint.

Cite this