ConceptTheory & Algos
Event overlap problem (interval partitioning)
The problem of finding the minimum number of clones (resources) needed to schedule and cover a set of overlapping time intervals.
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.