@inproceedings{89da0a4e344543df961d1cb71c5cf765,

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 = "null ; Conference date: 22-10-2011 Through 25-10-2011",

}