In this thesis we present a randomized online algorithm for the 2-server problem on the line, named R-LINE (for Randomized Line). This algorithm achieves the lowest competitive ratio of any known randomized algorithm for the 2-server problem on the line. The competitiveness of R-LINE is less than 1.901. This result provides a significant improvement over the previous known competitiveness of 155/78 (approximately 1.987), by Bartal, Chrobak, and Larmore, which was the first randomized algorithm for the 2-server problem one the line with competitiveness less than 2. Taking inspiration from this algorithm,we improve this result by utilizing ideas from T-theory, game theory, and linear programming
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expe...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
AbstractWe consider a generalization of the 2-server problem in which servers have different costs. ...
AbstractIn this paper we deal with a generalization of the k-server problem (Manasse 1988), in which...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
The weighted k-server problem is a natural generalization of the k-server problem in which the cost ...
The online 2-server problem presents a number of challenges in the search for simple competitive alg...
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
In this thesis we present a randomized online algorithm for the 2-server problem on the line, named ...
AbstractIn the k-server problem we wish to minimize, in an online fashion, the movement cost of k se...
AbstractIt has been a long-standing open problem to determine the exact randomized competitiveness o...
In the k-server problem we wish to minimize, in an online fashion, the movement cost of k servers i...
We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expe...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
We present a simple proof that the competitive ratio of any randomized online matching algorithm for...
AbstractWe consider a generalization of the 2-server problem in which servers have different costs. ...
AbstractIn this paper we deal with a generalization of the k-server problem (Manasse 1988), in which...
by Chi-ming Wat.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical ref...
The weighted k-server problem is a natural generalization of the k-server problem in which the cost ...
The online 2-server problem presents a number of challenges in the search for simple competitive alg...
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem...
Abstract. The k{server problem is one of the most important and well studied problems in the area of...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...