teaching:intro_par_alg2425
Rozdíly
Zde můžete vidět rozdíly mezi vybranou verzí a aktuální verzí dané stránky.
Obě strany předchozí revizePředchozí verzeNásledující verze | Předchozí verze | ||
teaching:intro_par_alg2425 [2024/10/29 09:16] – [Material Covered] Jiří Fiala | teaching:intro_par_alg2425 [2024/12/17 22:45] (aktuální) – 17. 12. Martin Koutecky | ||
---|---|---|---|
Řádek 4: | Řádek 4: | ||
===== Tutorial sessions ===== | ===== Tutorial sessions ===== | ||
- | Tutorials are led by [[https:// | + | Tutorials are led by [[https:// |
[[https:// | [[https:// | ||
you can find materials from the tutorial sessions and instructions on how to solve homework. | you can find materials from the tutorial sessions and instructions on how to solve homework. | ||
Řádek 15: | Řádek 15: | ||
| 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]**| | | 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 <typo fv: | | 15. 10. | FPT algorithm for <typo fv: | ||
- | | 22. 10. | Bounded Search Trees: <typo fv: | + | | 22. 10. | Bounded Search Trees: <typo fv: |
| 29. 10. | Iterative Compression for <typo fv: | | 29. 10. | Iterative Compression for <typo fv: | ||
- | + | | 5. 11. | //sport day - no class//| | |
- | /*| 16. 11. | Dynamic programming and convolutions on <typo fv: | + | | 12. 11. | Dynamic programming and convolutions on <typo fv: |
- | | 23. 11. | Treewidth, nice tree decompositions, | + | | 19. 11. | Treewidth, nice tree decompositions, |
- | | 30. 11. | More Treewidth - FPT alg., MSO, grids **[PA 7.7.1, 7.7.2 ]**| | + | | 26. 11. | More Treewidth - grids, bidimensionality |
- | | 7. 12. | Intro to neighborhood diversity and ILPs. Solving <typo fv: | + | | 3. 12. | Intro to neighborhood diversity and ILPs. Solving <typo fv: |
- | | 14. 12. | Neighborhood diversity: <typo fv: | + | | 10. 12. | Neighborhood diversity: <typo fv: |
- | | 21. 12. | Neighborhood diversity: | + | | 17. 12. | Plan: Neighborhood diversity: |
- | | 4. 1. | Parameterized reductions, The W-hierarchy | + | | 7. 1. | // |
- | | 11. 1. | $P||C_{\max}$ is FPT($d$) if $p_{\max}$ unary bounded, using the algorithm of Goemans-Rothvoss **[GR]**. Another application: | + | |
===== Materials ===== | ===== Materials ===== |
teaching/intro_par_alg2425.1730189804.txt.gz · Poslední úprava: 2024/10/29 09:16 autor: Jiří Fiala