Topics
algorithmMusic genre
Harmonic is a randomized $ k $-server algorithm that, at each step, given a request point $ r $, chooses the server to be moved to $ r $ with probability inversely proportional to the distance to $ r $. In this paper we prove that harmonic is $ 6 $-cotitive for $ k = 3 $
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 the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
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 the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
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...
We give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metr...
Several advancements in Online Algorithms can be credited to T-theory, a field of discrete mathemati...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
We consider the generalized k-server problem on uniform metrics. We study the power of memoryless al...
We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an ar...
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 the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
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 the (randomized) compound Harmonic algorithm for solving the generalized k-server prob...
In this paper we consider a generalized k-server problem with parallel requests where several serve...
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...
We give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metr...
Several advancements in Online Algorithms can be credited to T-theory, a field of discrete mathemati...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
In this paper we give deterministic competitive k-server algorithms for all k and all metric spaces....
We consider the generalized k-server problem on uniform metrics. We study the power of memoryless al...
We give the first polylogarithmic-competitive randomized algorithm for the k-server problem on an ar...
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 the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
Add to ORKG