In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers in response to a sequence of requests (we assume that k 2). The request issued at each step is speci ed by a point r in a given metric space M . To serve this request, one of the k servers must move to r. It is know
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
AbstractWe define a natural generalization of the prominent k-server problem, the k-resource problem...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
In the online k-server problem, an algorithm controls k mobile servers in a metric space. One by one...
Abst rac t. We consider the problem of k servers ituated on a uniform metric space that must serve a...
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...
Let M be a metric space on which we have k servers. A request is a point oe 2 M and is serviced eit...
The problem of k-t @ is a generalization of the famous k-server problem, where we must choose how k ...
In an online k-server routing problem, a crew of k servers has to visit points in a metric space as ...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
AbstractWe define a natural generalization of the prominent k-server problem, the k-resource problem...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
In the online k-server problem, an algorithm controls k mobile servers in a metric space. One by one...
Abst rac t. We consider the problem of k servers ituated on a uniform metric space that must serve a...
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...
Let M be a metric space on which we have k servers. A request is a point oe 2 M and is serviced eit...
The problem of k-t @ is a generalization of the famous k-server problem, where we must choose how k ...
In an online k-server routing problem, a crew of k servers has to visit points in a metric space as ...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
AbstractWe define a natural generalization of the prominent k-server problem, the k-resource problem...
The generalized k-server problem is a far-reaching extension of the k-server problem with several ap...
DOI
Add to ORKG