1 citations · 1 across the 1 of their papers we have counts for
1 paper
Nikhil Bansal, Niv Buchbinder, Aleksander Madry +2
We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a co…