Answers are grounded in this paper and cite their sources.
The k-server problem is investigated when the metric space is a tree. For this case an on-line k-competitive algorithm for k-servers is presented. The competitiveness ratio k is optimal. The algorithm is memoryless, in the sense that it does not use any information from the past.
No takes yet. Share an insight, caveat, or question.
Chrobák et al. (1991) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: