On the competitive ratio of the work function algorithm for the k-server problem

The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total mileage. The k-se...