原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
ach edge in E is covered by some vertex in V*. ▪ 34.5.4 The traveling-salesperson problem
In the traveling-salesperson problem, which is closely related to the hamiltonian-cycle problem, a salesperson must visit n cities. Let’s model the problem as a complete graph with n vertices, so that the salesperson wishes to make a tour, or hamiltonian cycle, visiting each city exactly once and finishing at the starting city. The salesperson
incurs a nonnegative integer cost c(i, j) to travel from city i to city j. In the optimiz
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea