原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
qual 1, this formulation is the optimization version of the NP-hard vertex-cover problem.
Let’s remove the constraint that x(v) ∈ {0, 1} and replace it by 0 ≤ x(v) ≤ 1, resulting in the following linear program: subject to We refer to this linear program as the linear-programming relaxation. Any feasible solution to the 0-1 integer program in lines (35.12)–(35.14) is also a feasible solution to its linear-programming relaxation
in lines (35.15)–(35.18). Therefore, the value of an optimal solution to the linear-progr
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea