知识卡片

普通读书笔记卡 · 3723.e.1

首次适配先放最早可容箱

理解等级:中级

首次适配按输入顺序处理物品,放入编号最小且仍能容纳它的已有箱;若不存在则新开一箱。

它是一种确定的在线式贪心规则,输出必可行;二倍近似比是章末题要求证明的结论,未在原文题干中给出证明。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      The first-fit heuristic takes each object in turn and places it into the first bin that can accommodate it, as follows. It maintains an ordered list of bins. Let b denote the number of bins in the list, where b increases over the course of the algorithm, and let 〈B1,

    参考来源

    - 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[50000,55000))。 - 结论依据:第35章加权顶点覆盖、子集和近似方案或章末问题定义与注记;习题未证明的近似比不作已证结论。 - 原始内容:The first-fit heuristic takes each object in turn and places it into the first bin that can accommodate it, as follows. It maintains an ordered list of bins. Let b denote the number of bins in the list, where b increases over the course of the algorithm, and let 〈 B 1 , … , B b 〉 be the list of bins. Initially b = 0 and the list is empty. The