ConceptTheory & Algos
Weighted interval scheduling
A variation of the interval scheduling problem where each interval has an associated weight, and the goal is to find a subset of non-overlapping intervals with the maximum total weight.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.