知识卡片

普通读书笔记卡 · 3716.c

加权顶点覆盖的线性松弛

理解等级:高级

加权顶点覆盖给每个顶点正权重,目标最小化所选权重和。

用0或1变量表示是否选顶点,并对每条边约束两端变量和至少为1;把变量域放宽到[0,1]形成线性松弛。

松弛最优值不大于整数最优值,因此可作为近似证明的下界。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第35章 近似算法 · 查看原书依据

      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

    参考来源

    - 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[35000,40000))。 - 结论依据:第35章“Approximating weighted vertex cover using linear programming”及原书公式图 Art_P1505.jpg、Art_P1506.jpg(式35.15–35.18):最小化 ∑_{v∈V}w(v)x(v),每条边 (u,v) 满足 x(u)+x(v)≥1,每个顶点满足 0≤x(v)≤1。原文指出每个整数可行解也满足这些松弛约束,故松弛最优值是最小权顶点覆盖的下界。 - 原始内容: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