Section Name Description
Themen und Vorlesungen File Lecture #0: Intro
File Lecture video #0: Intro
File Lecture #1: The push-relabel algorithm for the maximum flow problem
File Lecture #1: The push-relabel algorithm for the maximum flow problem (long)
File Lecture #2: Exact algorithms
File Lecture #2: Exact algorithms (long)
File Lecture #3: Approximation Algorithms
File Lecture #3: Approximation Algorithms (long)
File Lecture #4: Quadratic Program for MaxCut
File Lecture #4: Quadratic Program for MaxCut (long)
File Lecture #6: Rearrangemnet distance of phylogenetic trees
File Lecture #6: Rearrangemnet distance of phylogenetic trees (long)
File Lecture #8: Online Algorithms
File Lecture #8: Online Algorithms (long)
File Lecture #9: Succinct data structures
File Lecture #9: Succinct data structures (long)
File Lecture #10: Optimal Binary Search Trees and Splay Trees
File Lecture #10: Optimal Binary Search Trees and Splay Trees (long)
Übungen und Übungsblätter File LaTeX Template for exercise submissions
Literatur und zusätzliche Materialien URL [Goldberg, Tarjan '88] A new approach to the maximum-flow problem
URL [Mann '17] The Top Eight Misconceptions about NP-Hardness
URL [GW '95] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
URL [BS '05] On the computational complexity of the rooted subtree prune and regraft distance
URL [RSW '06] The maximum agreement forest problem: Approximation algorithms and computational experiments
URL [Jacobson '89] Space-efficient static trees and graphs