原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
mutually compatible activities in Sij consists of |Aij | = |Aik| + |Akj | + 1 activities.
The usual cut-and-paste argument shows that an optimal solution Aij must also include optimal solutions to the two subproblems for Sik and Skj.
If you could find a set of mutually compatible activities in Skj where , then you could u
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea