A polylogarithmic-competitive algorithm for the k-server problem

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

doi:10.1109/FOCS.2011.63

A polylogarithmic-competitive algorithm for the k-server problem

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

Open University of Israel, Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 ³ n log ² 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 language	English
Title of host publication	Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011
Pages	267-276
Number of pages	10
DOIs	https://doi.org/10.1109/FOCS.2011.63
State	Published - 2011
Event	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 - Palm Springs, CA, United States Duration: 22 Oct 2011 → 25 Oct 2011

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Conference

Conference	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011
Country/Territory	United States
City	Palm Springs, CA
Period	22/10/11 → 25/10/11

Keywords

competitive analysis
k-server problem
randomized algorithms

All Science Journal Classification (ASJC) codes

General Computer Science

Access to Document

10.1109/FOCS.2011.63

Cite this

@inproceedings{a05789dce1074c90b883888b8f17f89e,

title = "A polylogarithmic-competitive algorithm for the k-server problem",

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 {\~O}(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.",

keywords = "competitive analysis, k-server problem, randomized algorithms",

author = "Nikhil Bansal and Niv Buchbinder and Aleksander M{\c a}dry and Joseph Naor",

year = "2011",

doi = "10.1109/FOCS.2011.63",

language = "الإنجليزيّة",

isbn = "9780769545714",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

pages = "267--276",

booktitle = "Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011",

note = "2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011 ; Conference date: 22-10-2011 Through 25-10-2011",

}

Bansal, N, Buchbinder, N, Ma̧dry, A & Naor, J 2011, A polylogarithmic-competitive algorithm for the k-server problem. in Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011., 6108181, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 267-276, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, United States, 22/10/11. https://doi.org/10.1109/FOCS.2011.63

A polylogarithmic-competitive algorithm for the k-server problem. / Bansal, Nikhil; Buchbinder, Niv; Ma̧dry, Aleksander et al.
Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. 2011. p. 267-276 6108181 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A polylogarithmic-competitive algorithm for the k-server problem

AU - Bansal, Nikhil

AU - Buchbinder, Niv

AU - Ma̧dry, Aleksander

AU - Naor, Joseph

PY - 2011

Y1 - 2011

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

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

KW - competitive analysis

KW - k-server problem

KW - randomized algorithms

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

U2 - 10.1109/FOCS.2011.63

DO - 10.1109/FOCS.2011.63

M3 - منشور من مؤتمر

SN - 9780769545714

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 267

EP - 276

BT - Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011

T2 - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011

Y2 - 22 October 2011 through 25 October 2011

ER -

A polylogarithmic-competitive algorithm for the k-server problem

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this