原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
er starting from the hamiltonian-cycle or hamiltonian-path problem (see Exercise 34.5-6).
Make big rewards and big penalties The strategy for reducing the hamiltonian-cycle problem with a graph G to the traveling-salesperson problem encouraged using edges present in G when choosing edges for the traveling-salesperson tour. The reduction did so by giving these edges a low weight: 0. In other words, we gave a big reward for using these edges.
Alternatively, the reduction could have given the edges in G a finite weight and given ed
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea