An Optimal On-Line Algorithm for k-Servers on Trees

@article{Chrobak1991AnOO,
  title={An Optimal On-Line Algorithm for k-Servers on Trees},
  author={Marek Chrobak and Lawrence L. Larmore},
  journal={SIAM J. Comput.},
  year={1991},
  volume={20},
  pages={144-148}
}
We investigate the k-server problem when the metric space is a tree. For this case we present an on-line k-competitive algorithm for k servers. The competitiveness ratio k is optimal. The algorithm is memoryless, in the sense that it does not use any information from the past. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…