Content
Introduction to advanced and modern topics of algorithm design and analysis, with a particular emphasis on coping with presumable worst-case intractability.
Particular topics include:
- algorithmic game theory,
- algorithmic graph theory,
- approximation and online algorithms,
- computational geometry,
- computational social choice,
- distributed algorithms,
- online algorithms,
- parameterized and exact algorithms,
- randomized algorithms and analysis,
- universal solvers.