原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
than ρ |V|. Therefore, using A solves the hamiltonian-cycle problem in polynomial time. ▪
The proof of Theorem 35.3 serves as an example of a general technique to prove that no good approximation algorithm exists for a particular problem. Given an NP-hard decision problem X, produce in polynomial time a minimization problem Y such that “yes” instances of X correspond to instances of Y with value at most k (for some k), but that “no”
instances of X correspond to instances of Y with value greater than ρk. This technique sh
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea