← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

27 第27章 在线算法

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

that knows the future inputs, and taking a worst-case ratio over all possible instances.

We call this methodology competitive analysis. We’ll use a similar approach when we study approximation algorithms in Chapter 35, where we’ll compare the solution returned by an algorithm that might be suboptimal with the value of the optimal

solution, and determine a worst-case ratio over all possible instances. We start with a “

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea