知识卡片
修剪列表用较小值代表
对子集和列表按升序修剪时,若较小保留值z与待删值y满足z≤y≤(1+δ)z,就可以让z代表y。
保留较小值既不超出目标,又把相近状态合并;单次修剪线性完成,但误差会跨轮累积。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第35章 近似算法 · 查看原书依据
The key to devising a fully polynomial-time approximation scheme for the subset-sum problem is to “trim” each list Li after it is created. Here’s the idea behind trimming: if two values in L are close to each other, then since the goal is just an approximate solution, there is no need to maintain both of them explicitly. More precisely, use a
参考来源
- 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[45000,50000))。
- 结论依据:第35章加权顶点覆盖、子集和近似方案或章末问题定义与注记;习题未证明的近似比不作已证结论。
- 原始内容:The key to devising a fully polynomial-time approximation scheme for the subset-sum problem is to “trim” each list L i after it is created. Here’s the idea behind trimming: if two values in L are close to each other, then since the goal is just an approximate solution, there is no need to maintain both of them explicitly. More precisely, use a