原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
n set xi = 1. Otherwise, , and set xi = 0. We claim that every clause Cj, for j = 1, 2, …
, k, is satisfied by this assignment. To prove this claim, note that to achieve a sum of 4 in the digit labeled by Cj, the subset S′ must include at least one vi or value that has a 1 in the digit labeled by Cj, since the contributions of the slack variables sj and together sum to at most 3.
If S′ includes a that has a 1 in Cj’s position, then the literal xi appears in clause Cj.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea