On space bounded server algorithms

This paper is motivated by the need for fast algorithms for online problems, many of which require algorithms to provide solutions in real time. We study a class of arguably fast algorithms (called space bounded algorithms) for the k-server problem on finite metric spaces. Specifically, we provide a necessary and sufficient condition for such algorithms to be competitive on finite metric spaces. Moreover, this characterization provides a strategy for designing competitive algorithms for finite metric spaces