原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
rithms compute exact solutions, some randomized algorithms compute approximate solutions.
We say that a randomized algorithm for a problem has an approximation ratio of ρ(n) if, for any input of size n, the expected cost C of the solution produced by the randomized algorithm is within a factor of ρ(n) of the cost C* of an optimal solution: We call a randomized algorithm that achieves an approximation ratio of ρ(n) a
randomized ρ(n)-approximation algorithm. In other words, a randomized approximation algor
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea