The introductory lectures provide some motivating examples, and discuss a first problem (stable matching) as well as an efficient algorithm for solving this problem in detail. In addition, some attention is paid to the background required for this course: basic proving techniques, and run-time analysis.

Recorded lectures:

• “Stable matching” last slide gives information to TU Delft students
• “Stable matching (continued)” last slide gives information to TU Delft students
• “Computational tractability” please watch until 15:50
• “Asymptotic order of growth” please watch until 46:30

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