@techreport{Csaba2001,
TITLE = {A Randomized On-line Algorithm for the k-Server Problem on a Line},
AUTHOR = {Csaba, Bela and Lodha, Sachin},
LANGUAGE = {eng},
NUMBER = {DIMACS TechReport 2001-34},
INSTITUTION = {DIMACS-Center for Discrete Mathematics \& Theoretical Computer Science},
ADDRESS = {Piscataway, NJ},
YEAR = {2001},
DATE = {2001},
ABSTRACT = {We give a O(n^2 \over 3}\log{n})-competitive randomized k--server algorithm when the underlying metric space is given by n equally spaced points on a line. For n = k + o(k^{3 \over 2}/\log{k), this algorithm is o(k)--competitive.},
}