Competitive Algorithms for the Weighted Server Problem

@inproceedings{Fiat1993CompetitiveAF,
  title={Competitive Algorithms for the Weighted Server Problem},
  author={Amos Fiat and Moty Ricklin},
  booktitle={ISTCS},
  year={1993}
}
Fiat, A. and M. Ricklin, Competitive algorithms for the weighted server problem, Theoretical Computer Science 130 (1994) 85-99. In this paper we deal with a generalization of the k-server problem (Manasse et al. 1988) in which the servers are unequal. In the weighted server mode1 each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of the distance traversed and the server weight. A weighted k-server algorithm is called competitive if the… CONTINUE READING