Add to ORKGWe give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k + o(k^{3 \over 2}/\log{k), this algorithm is o(k)--competitive
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...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
We give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metr...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an ar...
We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem o...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expe...
AbstractThe first general decomposition theorem for the k-server problem is presented. Whereas all p...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
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...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
We give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metr...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an ar...
We give the first polylogarithmic-competitive randomized online algorithm for the k-server problem o...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expe...
AbstractThe first general decomposition theorem for the k-server problem is presented. Whereas all p...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
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...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...