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 - https://www.scopus.com/pages/publications/84862635899
U2 - 10.1109/FOCS.2011.63
DO - 10.1109/FOCS.2011.63
M3 - Conference contribution
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 -