原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
for z*, which is the largest value in Ln, which is to say Now we show that y*/z* ≤ 1 + ϵ.
We do so by showing that (1 +ϵ/2n)n ≤ 1 + ϵ. First, inequality (35.23), 0 < ϵ < 1, implies that Next, from equation (3.16) on page 66, we have limn→∞(1 + ϵ/2n)n = eϵ/2. Exercise 35.5-3 asks you to show that Therefore, the function (1 + ϵ/2n)n increases with n as it approaches its limit of eϵ/2, and we have Combining
inequalities (35.26) and (35.29) completes the analysis of the approximation ratio. To sh
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea