知识卡片

普通读书笔记卡 · 3716.c.1

半阈值舍入加权顶点覆盖

理解等级:高级

线性松弛的每条边满足x(u)+x(v)≥1,因此至少一端变量值≥1/2;选入所有达到半阈值的顶点便覆盖每条边。

被选顶点的权重至多是松弛目标值的两倍,而松弛值不超过整数最优值,故得到二倍近似。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      Combining inequalities (35.19) and (35.20) gives w(C) ≤ 2z* ≤ 2w(C*), and hence APPROX-MIN-WEIGHT-VC is a 2-approximation algorithm. ▪ Exercises 35.4-1 Show that even if a clause is allowed to contain both a variable and its negation, randomly setting each variable to 1 with probability 1/2 and to 0 with probability 1/2 still yields

    参考来源

    - 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[40000,45000))。 - 结论依据:第35章加权顶点覆盖、子集和近似方案或章末问题定义与注记;习题未证明的近似比不作已证结论。 - 原始内容:Combining inequalities (35.19) and (35.20) gives w ( C ) ≤ 2 z * ≤ 2 w ( C *), and hence A PPROX -M IN -W EIGHT -VC is a 2-approximation algorithm. ▪ Exercises 35.4-1 Show that even if a clause is allowed to contain both a variable and its negation, randomly setting each variable to 1 with probability 1/2 and to 0 with probability 1/2 still yields