知识卡片
全多项式近似方案
FPTAS除满足(1+ε)近似外,还要求运行时间同时对实例规模n与1/ε为多项式。
因而把ε缩小固定倍数时,开销只增加多项式表达式中的固定倍数;它比仅固定ε时多项式的PTAS有更强效率保证。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
- · 全多项式近似方案
原书出处 · 1 处
- 第35章 近似算法 · 查看原书依据
We say that an approximation scheme is a fully polynomial-time approximation scheme if it is an approximation scheme and its running time is polynomial in both 1/ϵ and the size n of the input instance. For example, the scheme might have a running time of O((1/ϵ)2n3). With such a scheme, any constant-factor decrease in ϵ comes with a
参考来源
- 位置:《算法导论(第4版)》第35章《近似算法》(OEBPS/chapter035.xhtml,文本字符[0,5000))。
- 结论依据:第35章近似定义、顶点覆盖与满足三角不等式的旅行商算法;图35.1–35.2已核对。
- 原始内容:We say that an approximation scheme is a fully polynomial-time approximation scheme if it is an approximation scheme and its running time is polynomial in both 1/ ϵ and the size n of the input instance. For example, the scheme might have a running time of O ((1/ ϵ ) 2 n 3 ). With such a scheme, any constant-factor decrease in ϵ comes with a