This is an old revision of the document!
We will explore advanced techniques for the design and the analysis of algorithms with selected examples from modern algorithmics. Our discussion will include both polynomial time and exponential time exact algorithms, as well as approximation algorithms. Besides greedy algorithms, local search, streaming, and parallelism, we will study methods for the amortized analysis of algorithms and look into the role of linear programming in algorithmics. Topics will include network flows, and a short introduction to linear programming.
There will be a written exam in the usual exam period.