← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

35 第35章 近似算法

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

has an associated nonnegative processing time of pk, and m identical machines, M1, M2, …

, Mm. Any job can run on any machine. A schedule specifies, for each job Jk, the machine on which it runs and the time period

during which it runs. Each job Jk must run on some machine Mi for pk consecutive time uni

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea