Toto je starší verze dokumentu!

Introduction to Parameterized Algorithms 23/24

Tutorial sessions

Tutorials are led by Tung. Click here for the website of the tutorials, where you can find materials from the tutorial sessions and instructions on how to solve homework.

date	what was said [source]
5. 10.	Introduction to parameterized algorithms / complexity. [PA 1]
12. 10.	Kernelization [PA 2.1, 2.2.1, 2.3-intro, 2.3.1, 2.5 without Lemma 2.22]
19. 10.	Finishing kernels from last time. Bounded Search Trees: Vertex Cover in $\mathcal{O}^(1.6181^k)$ and $\mathcal{O}^(1.4656^k)$ time; Closest String in $\mathcal{O}^(d^d)$ time [PA 3.1, 3.5]*
26. 10.	Plan: FPT algorithm for Vertex Cover above LP [PA 3.4]; Begin Iterative Compression [PA 4]

[PA] is the book Parameterized Algorithms.