AbstractWe consider the server algorithm, called HARMONIC, that always moves the servers with probabilities proportional to the inverses of distances to the request point. We show that for two servers HARMONIC is 3-competitive. Before it was only known that the competitiveness constant of this algorithm is between 3 and 6
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
The Work Function Algorithm, a natural algorithm for the ^-server problem, is shown to have competit...
We consider the generalized on-line two-server problem in which each server moves in its own metric ...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
AbstractWe consider the server algorithm, called HARMONIC, that always moves the servers with probab...
Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, cho...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
In this paper the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
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....
In the paper a k-server problem with parallel requests where several servers can also be located on ...
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
We consider the general on-line two server problem in which at each step both servers receive a requ...
In this paper we consider the bicriteria formulation of the well-known online k-server problem where...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
The Work Function Algorithm, a natural algorithm for the ^-server problem, is shown to have competit...
We consider the generalized on-line two-server problem in which each server moves in its own metric ...
We consider the server algorithm, called HARMONIC, that always moves the servers with probabilities ...
AbstractWe consider the server algorithm, called HARMONIC, that always moves the servers with probab...
Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, cho...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
In this paper the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
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....
In the paper a k-server problem with parallel requests where several servers can also be located on ...
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
We consider the general on-line two server problem in which at each step both servers receive a requ...
In this paper we consider the bicriteria formulation of the well-known online k-server problem where...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
The Work Function Algorithm, a natural algorithm for the ^-server problem, is shown to have competit...
We consider the generalized on-line two-server problem in which each server moves in its own metric ...
DOI
Add to ORKG