Non-priority optimal interval Scheduling: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 11:5911:59, 10 October 2022‎ Admin talk contribs‎ 1,508 bytes +1,508‎ Created page with "== Problem Description== Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. The problems consider a set of tasks. Each task is represented by an interval describing the time in which it needs to be executed. For instance, task A might run from 2:00 to 5:00, task B might run from 4:00 to 10:00 and task C might run from 9:00 to 11:00. A subset of intervals is compatible if no two intervals overlap. For example, the..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Non-priority_optimal_interval_Scheduling"