原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
the worst case or the expected case). In practice, near-optimality is often good enough.
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
want to find a near-optimal solution. Depending on the problem, you could define an optim
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea