原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
contains a hamiltonian cycle by making use of the hypothesized approximation algorithm A.
Convert G into an instance of the traveling-salesperson problem as follows. Let G′ = (V, E′) be the complete graph on V, that is, E′ = {(u, v) : u, v ∈ V and u ≠ v}. Assign an integer cost to each edge in E′ as follows: Given a representation of G, it takes time polynomial in |V| and |E| to create representations of G′ and c. Now
consider the traveling-salesperson problem (G′, c). If the original graph G has a hamilto
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea