First come, first served (Unweighted Interval Scheduling, Online Interval Scheduling)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n+k)$? words

(^see above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=First_come,_first_served_(Unweighted_Interval_Scheduling,_Online_Interval_Scheduling)&oldid=47050"