原书出处
Introduction to Algorithms, Fourth Edition
27 第27章 在线算法
f an online algorithm A by A(I) and the solution value of an optimal algorithm F by F(I).
Online algorithm A has an expected competitive ratio c if for all inputs I, we have where the expectation is taken over the random choices made by A.
Although the deterministic MARKING algorithm has a competitive ratio of Θ(k) (Theorem 27.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter027.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea