On Space Bounded Server Algorithms.

ICCI '93: Proceedings of the Fifth International Conference on Computing and Information（1993）

引用 4|浏览8

暂无评分

摘要

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

查看译文

关键词

algorithm theory,network servers,online operation,real-time systems,competitive algorithm design,fast algorithms,finite metric spaces,k-server problem,necessary condition,online problems,real-time solutions,space bounded algorithms,sufficient condition,

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要