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] |
12. 10. | Plan: Kernelization [PA 2.1, 2.2.1, 2.3-intro, 2.3.1, 2.5 without Lemma 2.22] |
Materials
- [PA] is the book Parameterized Algorithms.
- [ND] Algorithmic Meta-theorems for Restrictions of Treewidth: a paper which introduced $nd(G)$ and describes the coloring algorithm
- [NdCol] A note on coloring...: a paper by Martin which retells the coloring algorithm by Lampis and points out that it can be solved more efficiently
- [5M] Integer programming in parameterized complexity: Five miniatures a comprehensive paper about various parameterized integer programming algorithms and their applications to problems on bounded-$nd$ graphs.
teaching/intro_par_alg2425.1728335980.txt.gz · Poslední úprava: 2024/10/07 23:19 autor: Martin Koutecky