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
AbstractIn this paper we deal with a generalization of the k-server problem (Manasse 1988), in which...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
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...
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...
Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, cho...
In the paper a k-server problem with parallel requests where several servers can also be located on ...
AbstractWe consider a generalization of the 2-server problem in which servers have different costs. ...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
AbstractIn this paper we deal with a generalization of the k-server problem (Manasse 1988), in which...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
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...
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...
Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, cho...
In the paper a k-server problem with parallel requests where several servers can also be located on ...
AbstractWe consider a generalization of the 2-server problem in which servers have different costs. ...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
We propose a new algorithm called Equipoise for the k-server problem, and we prove that it is 2-comp...
\u3cp\u3eThe generalized k-server problem is a far-reaching extension of the k-server problem with s...
AbstractIn this paper we deal with a generalization of the k-server problem (Manasse 1988), in which...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
We study a variant of the k-server problem, the infinite server problem, in which infinitely many se...
DOI
Add to ORKG