← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

25 第25章 二分图匹配

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

ant to find a perfect matching M* such that w(M*) = max {w(M) : M is a perfect matching}.

We call finding such a maximum-weight perfect matching the assignment problem. A solution to the assignment problem is a perfect matching that maximizes the total utility. Like the stable-marriage problem, the

assignment problem finds a matching that is “good,” but with a different definition of go

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea