原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
HORTEST-PATH is the single-pair shortest-path problem in an unweighted, undirected graph.
NP-completeness applies directly not to optimization problems, however, but to decision problems, in which the answer is simply “yes” or “no” (or, more formally, “1” or “0”). Although NP-complete problems are confined to the realm of decision problems, there is usually a way to cast a given optimization problem as a related decision problem by imposing a bound on the value to be optimized.
For example, a decision problem related to SHORTEST-PATH is PATH: given an undirected gra
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea