原书出处
Introduction to Algorithms, Fourth Edition
35 第35章 近似算法
ediate steps. Put another way, cutting out an intermediate stop never increases the cost.
Such a cost function c satisfies the triangle inequality: for all vertices u, v, w ∈ V, c(u, w) ≤ c(u, v) + c(v, w). The triangle inequality seems as though it should naturally hold, and it is automatically satisfied in several applications. For example, if the vertices of the graph are points in the plane and the cost of traveling
between two vertices is the ordinary euclidean distance between them, then the triangle i
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter035.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea