原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
structure than the traveling-salesperson problem, in which edge weights are unrestricted.
Look for special cases Several NP-complete problems are just special cases of other NP-complete problems. For example, consider the decision version of the 0-1 knapsack problem: given a set of n items, each with a weight and a value, does there exist a subset of items whose total weight is at most a given weight W and whose total value is at least
a given value V? You can view the set-partition problem in Exercise 34.5-5 as a special c
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea