← 返回起始笔记位置

知识卡片

普通读书笔记卡 · 3723

近似算法追求可控误差

理解等级:初级

近似算法为难以高效精确求解的优化问题,在可接受时间内给出接近最优的可行解。

它仍需说明解的质量保证;“运行很快”或“看起来不错”本身都不是近似比证明。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      We call an algorithm that returns near-optimal solutions an approximation algorithm. This chapter presents polynomial-time approximation algorithms for several NP-complete problems. Performance ratios for approximation algorithms Suppose that you are working on an optimization problem in which each potential solution has a positive cost, and you

    参考来源

    - 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[0,5000))。 - 结论依据:第35章近似定义、顶点覆盖与满足三角不等式的旅行商算法;图35.1–35.2已核对。 - 原始内容:We call an algorithm that returns near-optimal solutions an approximation algorithm . This chapter presents polynomial-time approximation algorithms for several NP-complete problems. Performance ratios for approximation algorithms Suppose that you are working on an optimization problem in which each potential solution has a positive cost, and you