Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectioni [2012/02/24 20:54] – [Designing a Greedy Algorithm] mugabej | courses:cs211:winter2012:journals:jeanpaul:chapterfour_sectioni [2012/02/24 20:55] (current) – [Designing a Greedy Algorithm] mugabej | ||
|---|---|---|---|
| Line 65: | Line 65: | ||
| >>>>>>>>>> | >>>>>>>>>> | ||
| - | --> With this algorithm, every interval is assigned a label and no two overlapping intervals receive the same label | + | --> With this algorithm, every interval is assigned a label and no two overlapping intervals receive the same label.\\ |
| + | \\ | ||
| --> This algorithm also schedules every interval on a resource using a number of resources equal to the depth of the set of intervals.\\ | --> This algorithm also schedules every interval on a resource using a number of resources equal to the depth of the set of intervals.\\ | ||
| \\ | \\ | ||
