Prof. Dr. Ir. Arie M.C.A. Koster
general / CV / research / publications / teaching / supervision / resources /
- PhD course on Algorithmic Graph Theory: How hard is your combinatorial optimization problem?
Clemson University, June 2017 - Lecture Notes
- lecture 1: Complexity Theory
- lecture 2: Examples of polynomial solvable special cases
- lecture 3: Algorithms for interval and chordal graphs
- lecture 4: Recognition of chordal graphs
- lecture 5: Tree Decompositions and Treewidth
- lecture 6: Computing Treewidth
- lecture 7 and 8: Dynamic Programming with Treewidth
- lecture 9 and 10: Fixed Parameter Tractability
- lecture 11: Exact Exponential Algoritms
- lecture 12: Dynamic Programming for TSP
last modified: 14/06/2017 - 18:04
math2.rwth-aachen.de