Unformatted text preview: Solving interval scheduling
I A request is a pair of integers (s, F) with 0 g s 5 f.
A set A of requests is compatible if for all distinct (s, f), (5’, i”) E A,
either 5’ 3 f or s 2 f” — that is, the requests' time intervals don't overlap. Input: An array R of or requests (51, 1(1),... ,(smfn).
Desired Output: A compatible subset of R of maximum possible size. ...
View Full Document
- Fall '19
- Set Theory, Natural number, G S, Serialism