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.

Back to top