Competitive k-server algorithms

Amos Fiat, Yuval Rabani, Yiftach Ravid

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces. This settles the k-server conjecture up to the competitive ratio. The best previous result for general metric spaces was a three-server randomized competitive algorithm and a non-constructive proof that a deterministic three-server competitive algorithm exists. The competitive ratio we can prove is exponential in the number of servers. Thus, the question of the minimal competitive ratio for arbitrary metric spaces is still open.

Original languageEnglish
Pages (from-to)410-428
Number of pages19
JournalJournal of Computer and System Sciences
Volume48
Issue number3
DOIs
StatePublished - Jun 1994

Fingerprint

Dive into the research topics of 'Competitive k-server algorithms'. Together they form a unique fingerprint.

Cite this