原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
n is at least Thus, for sufficiently long request sequences, we have shown the following:
Theorem 27.4 Any deterministic online algorithm for caching with a cache size of k has competitive ratio Ω(k). ▪ Although we can analyze the common caching strategies from the point of view of competitive analysis, the results
are somewhat unsatisfying. Yes, we can distinguish between algorithms with a competitive
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea