1. Bein W, Chrobak M, Larmore LL (2002) The 3-server problem in the plane. Theor Comput Sci 287:387–391
2. Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
3. Chrobak M, Larmore LL (1991) An optimal online algorithm for k servers on trees. SIAM J Comput 20:144–148
4. Chrobak M, Karloff H, Payne TH, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4:172–181
5. Koutsoupias E, Papadimitriou C (1994) On the k-server conjecture. In: Proceedings of the 26th symposium on theory of computing (STOC). ACM, Montreal, pp 507–511