A polylogarithmic-competitive algorithm for the k-server problem

Nikhil Bansal, Niv Buchbinder, Aleksander Ma̧dry, Joseph Naor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of Õ(log 3 n log 2 k) for any metric space on n points. This improves upon the (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [22] whenever n is sub-exponential in k.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011
Pages267-276
Number of pages10
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 - Palm Springs, CA, United States
Duration: 22 Oct 201125 Oct 2011

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011
Country/TerritoryUnited States
CityPalm Springs, CA
Period22/10/1125/10/11

Keywords

  • competitive analysis
  • k-server problem
  • randomized algorithms

Fingerprint

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

Cite this