← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

14 第14章 动态规划

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.699Z

Bentley has suggested simplifying the problem by considering only bitonic tours, that is,

tours that start at the leftmost point, go strictly rightward to the rightmost point, and then go strictly leftward back to the starting point.

Figure 14.11(b) shows the shortest bitonic tour of the same 7 points. In this case, a pol

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea