原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
a constant factor (though not necessarily the same constant factor by which ϵ decreased).
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
corresponding constant-factor increase in the running time. Chapter outline The first fou
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea