Competitive k-server algorithms

Amos Fiat; Yuval Rabani; Yiftach Ravid

doi:10.1016/S0022-0000(05)80060-1

Competitive k-server algorithms

Amos Fiat^*, Yuval Rabani, Yiftach Ravid

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

47 Scopus citations

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 language	English
Pages (from-to)	410-428
Number of pages	19
Journal	Journal of Computer and System Sciences
Volume	48
Issue number	3
DOIs	https://doi.org/10.1016/S0022-0000(05)80060-1
State	Published - Jun 1994
Externally published	Yes

Access to Document

10.1016/S0022-0000(05)80060-1

Cite this

@article{16f1c3927b794a43b6a2fa37e0e003ca,

title = "Competitive k-server algorithms",

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.",

author = "Amos Fiat and Yuval Rabani and Yiftach Ravid",

year = "1994",

month = jun,

doi = "10.1016/S0022-0000(05)80060-1",

language = "אנגלית",

volume = "48",

pages = "410--428",

journal = "Journal of Computer and System Sciences",

issn = "0022-0000",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Competitive k-server algorithms

AU - Fiat, Amos

AU - Rabani, Yuval

AU - Ravid, Yiftach

PY - 1994/6

Y1 - 1994/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028460060&partnerID=8YFLogxK

U2 - 10.1016/S0022-0000(05)80060-1

DO - 10.1016/S0022-0000(05)80060-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0028460060

SN - 0022-0000

VL - 48

SP - 410

EP - 428

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

Competitive k-server algorithms

Abstract

Access to Document

Other files and links

Fingerprint

Cite this