Greedy algorithms are algorithms designed using an intuitive rule of thumb, which can be proven to lead to optimal solutions. In these lectures, several examples of problems and such algorithms are given to illustrate this general concept. In addition, quite some time is spent on the proving techniques required to show the correctness and optimality of the presented algorithms.

Recorded lectures:

• “Interval schedulingl”  last slide gives information to TU Delft students
• “Interval partitioning” please watch until 25:30
• “Scheduling to minimize maximum lateness” please watch until 59:10
• “Greedy analysis strategies”  please watch until 10:10
• “Shortest path in a graph”  please watch until 51:10
• “Minimum spanning tree”  last slide gives information to TU Delft students
• “Clustering”  please watch until 44:20
• “Huffman codes”  please watch until 1:17:10

Slides:
Slides with thanks to Kevin Wayne and Pearson Education (made available together with the book “Algorithm Design” by Kleinberg & Tardos)