← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

35 第35章 近似算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.786Z

|U0| = |X|, |U1| ≤ |U0| (1 − 1/k), |U2| ≤ |U1| (1 − 1/k) = |U| (1 − 1/k)2, and in general

The algorithm stops when Ui = Ø, which means that |Ui| < 1. Thus an upper bound on the number of iterations of the algorithm is the smallest value of i for which |Ui| < 1. Since 1 + x ≤ ex for all real x (see inequality (3.14) on page 66), by letting x = −1/k, we have 1 − 1/k ≤ e−1/k, so that (1 − 1/k)k ≤ (e−1/k)k = 1/e.

Denoting the number i of iterations by ck for some nonnegative integer c, we want c such

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea