![]() |
|---|
Graduate Course - Algorithm design
| Overview | Slides | Exercises |
| Graphs | Slides | Exercises |
| Costs | Slides | Exercises |
| Greedy | Slides | Exercises |
| Greedy II | Slides | Exercises |
| Divide and conquer | Slides | Exercises |
| Dynamic programming | Slides | Exercises |
| Network flow | Slides | Exercises |
| Sets | Slides | Exercises |
| Intractability | Slides | Exercises |