知识卡片

普通读书笔记卡 · 3718.b.1.a

树遍历捷径形成二倍旅行

理解等级:高级

树的完整往返遍历把每条树边走两次,成本为生成树权重的两倍。

按三角不等式跳过重复顶点不增成本,余下的首次访问顺序组成旅行环;结合生成树下界,得到至多两倍最优旅行费用。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      By the triangle inequality, however, deleting a visit to any vertex from W does not increase the cost. (When a vertex v is deleted from W between visits to u and w, the resulting ordering specifies going directly from u to w.) Repeatedly apply this operation on each visit to a vertex after the first time it’s visited in W, so that W is left

    参考来源

    - 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[15000,20000))。 - 结论依据:第35章近似定义、顶点覆盖与满足三角不等式的旅行商算法;图35.1–35.2已核对。 - 原始内容:By the triangle inequality, however, deleting a visit to any vertex from W does not increase the cost. (When a vertex v is deleted from W between visits to u and w , the resulting ordering specifies going directly from u to w .) Repeatedly apply this operation on each visit to a vertex after the first time it’s visited in W , so that W is left