teaching:intro_par_alg2425
Toto je starší verze dokumentu!
Introduction to Parameterized Algorithms 24/25
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.
Material Covered
date | what was said [source] |
---|---|
1. 10. | Introduction to parameterized algorithms / complexity. [PA 1] |
8. 10. | Kernelization [PA 2.1, 2.2.1, 2.3-intro, 2.3.1]. Crown decomposition lemma proof was from [Ker, Lemma 4.5] |
15. 10. | FPT algorithm for Vertex Cover above LP [PA 3.4], |
22. 10. |
teaching/intro_par_alg2425.1730189804.txt.gz · Poslední úprava: 2024/10/29 09:16 autor: Jiří Fiala