知识卡片
子集和优化版不超目标
- 子集和的判定版问能否恰好凑成目标t;
- 优化版则在所有不超过t的子集和中取最大值。
即使无法精确凑到t,优化版仍有解和质量比较,因此可讨论近似算法。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第35章 近似算法 · 查看原书依据
, xn} whose sum is as large as possible but not larger than t. For example, consider a truck that can carry no more than t pounds, which is to be loaded with up to n different boxes, the ith of which weighs xi pounds. How heavy a load can the truck take without exceeding the t-pound
参考来源
- 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[40000,45000))。
- 结论依据:第35章加权顶点覆盖、子集和近似方案或章末问题定义与注记;习题未证明的近似比不作已证结论。
- 原始内容:The optimization problem seeks a subset of { x 1 , x 2 , … , x n } whose sum is as large as possible but not larger than t . For example, consider a truck that can carry no more than t pounds, which is to be loaded with up to n different boxes, the i th of which weighs x i pounds. How heavy a load can the truck take without exceeding the t -pound