Approximation Algorithms, Copenhagen University, Spring 2021

Prerequisites: Students should be comfortable with formal, mathematical reasoning, as the course uses the power of mathematics to understand and prove good performance of algorithms. It is assumed that students have completed an algorithms course, and are comfortable using mathematical proofs in the analysis of algorithms.

Lecturer: Rasmus Pagh

Literature:

Lectures:

Creative Commons License The course materials are licensed under a Creative Commons Attribution 4.0 International License.