Add to ORKGWe 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 competitive ratio of O(log^3 n log^2 k log log n) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [J.ACM'95] whenever n is sub-exponential in k
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem...
We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem o...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
AbstractThe first general decomposition theorem for the k-server problem is presented. Whereas all p...
The weighted k-server problem is a natural generalization of the k-server problem in which the cost ...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
The generalized k-server problem is an extension of the weighted k-server problem, which in turn ext...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem...
We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem o...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
AbstractThe first general decomposition theorem for the k-server problem is presented. Whereas all p...
The weighted k-server problem is a natural generalization of the k-server problem in which the cost ...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
The generalized k-server problem is an extension of the weighted k-server problem, which in turn ext...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...