原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
ility to know what the next few requests will be. We say that an algorithm is l-lookahead
if it has the ability to look ahead at the next l requests. Prove that for every constant l ≥ 0 and every cache size k ≥1, every deterministic l-lookahead algorithm has competitive ratio
Ω(k). Problems 27-1 Cow-path problem The Appalachian Trail (AT) is a marked hiking trail
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea