Topics of the course
- Algorithms (sorting, Dijkstra, TSP, maximum matchings, certificates (Tutte's Theorem), network flows and its applications (Menger's Theorem, Baranyai's Theorem), Stable Matching and its application (list coloring))
- Linear Programming (Simplex Algorithm), Duality and its applications in Combinatorics and Algorithms
- Randomized algorithms (randomized matching algorithms, hypergraph-coloring, derandomization, Erdos-Selfridge Criterion, algorithmization of Local Lemma)
Further information about the course will be available at the course website: http://discretemath.imp.fu-berlin.de/DMII-2018-19/