原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
hich is to say that the problem might be either a maximization or a minimization problem.
We say that an algorithm for a problem has an approximation ratio of ρ(n) if, for any input of size n, the cost C of the solution produced by the algorithm is within a factor of ρ(n) of the cost C* of an optimal solution: If an algorithm achieves an approximation ratio of ρ(n), we call it a ρ(n)-approximation algorithm. The
definitions of approximation ratio and ρ(n)-approximation algorithm apply to both minimiz
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea