Algorithm Design And Analysis Part 2 Greedy

We start by informally describing what a

In this lecture, we introduce the notion of

Proof that EFT is optimal (first

This course covers the essential information that every serious programmer needs to know about

Sub-optimal

We formally define two well studied problem and think about

Interval colouring, minimum total completion time and minimum lateness.

Algorithms

Algorithms

[COR-IS1702] Week 11 - Part 2: Greedy Algorithm