Work-conserving schedulers (Unweighted Interval Scheduling, Online Interval Scheduling)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Work-conserving_schedulers_(Unweighted_Interval_Scheduling,_Online_Interval_Scheduling)&oldid=47053"