← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

35 第35章 近似算法

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

pendent. A clause is not satisfied only if all three of its literals are set to 0, and so

Pr {clause i is not satisfied} = (1/2)3 = 1/8. Thus, we have Pr {clause i is satisfied} = 1 − 1/8 = 7/8, and Lemma 5.1 on page 130 gives E [Yi] = 7/8. Let Y be the number of satisfied clauses overall, so that Y = Y1 + Y2 + ⋯ + Ym. Then, we have Since m is an upper bound on the number of satisfied clauses, the approximation ratio is at most

m/(7m/8) = 8/7. ▪ Approximating weighted vertex cover using linear programming The minimu

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea