Add to ORKGThe optimal off-line algorithm for solving the k-server problem is usually implemented by network flows. In this paper, we first propose certain modifications to each step of the original network-flow implementation. Next, by experiments we demonstrate that the proposed modifications improve the speed of the algorithm. Finally, we investigate how similar ideas for improvement can also be applied to some related on-line algorithms
In this paper, we present tight bounds for the k-server problem with delays in the uniform metric sp...
In this paper we consider k-server problems with parallel requests where several servers can also be...
We consider a modification of the well known work function algorithm (WFA) for solving the on-line k...
The optimal off-line algorithm for solving the k-server problem is usually implemented by network fl...
In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server pro...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
Abstract In this paper we consider the bicriteria version of the well-known k -server problem in whi...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
In this paper we consider the bicriteria version of the well-known k-server problem in which the co...
AbstractIn this paper we consider the bicriteria version of the well-known k-server problem in which...
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...
In this paper the compound work function algorithm for solving the generalized k-server problem is p...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
In this paper, we present tight bounds for the k-server problem with delays in the uniform metric sp...
In this paper we consider k-server problems with parallel requests where several servers can also be...
We consider a modification of the well known work function algorithm (WFA) for solving the on-line k...
The optimal off-line algorithm for solving the k-server problem is usually implemented by network fl...
In this paper we study a modified work function algorithm (WFA) for solving the on-line k-server pro...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
Abstract In this paper we consider the bicriteria version of the well-known k -server problem in whi...
The k-server problem is that of planning the motion of k mobile servers on the vertices of a graph u...
In this paper we consider the bicriteria version of the well-known k-server problem in which the co...
AbstractIn this paper we consider the bicriteria version of the well-known k-server problem in which...
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...
In this paper the compound work function algorithm for solving the generalized k-server problem is p...
This paper deals with the work function algorithm (WFA) for solving the on-line k-server problem. Th...
In this paper, we present tight bounds for the k-server problem with delays in the uniform metric sp...
In this paper we consider k-server problems with parallel requests where several servers can also be...
We consider a modification of the well known work function algorithm (WFA) for solving the on-line k...