Rozdíly

Zde můžete vidět rozdíly mezi vybranou verzí a aktuální verzí dané stránky.

--- teaching:intro_par_alg2526 [2025/10/20 13:15] – [Material Covered] Jiří Fiala
+++ teaching:intro_par_alg2526 [2025/10/20 13:17] (aktuální) – [Material Covered] Jiří Fiala
@@ Řádek 15: / Řádek 15: @@
 | 6. 10. | Kernelization **[PA 2.1, 2.2.1, 2.3-intro, 2.3.1]**. Crown decomposition lemma proof was from **[Ker, Lemma 4.5]**|
 | 13. 10. | Bounded Search Trees: <typo fv:small-caps>Vertex Cover</typo> in $\mathcal{O}^*(1.6181^k)$ and $\mathcal{O}^*(1.4656^k)$ time; <typo fv:small-caps>Closest String</typo> in $\mathcal{O}^*(d^d)$ time **[PA 3.1, 3.5]** |
-| 20. 10. | FPT algorithms for <typo fv:small-caps>Feedback Vertex Set</typo> in $\mathcal{O}^*((3k)^k)$ time and for <typo fv:small-caps>Vertex Cover above LP **[PA 3.4]**</typo>,|
+| 20. 10. | FPT algorithms for <typo fv:small-caps>Feedback Vertex Set</typo> in $\mathcal{O}^*((3k)^k)$ time and for <typo fv:small-caps>Vertex Cover above LP in $\mathcal{O}^*(4^d)$ **[PA 3.3, 3.4]**</typo>,|
 /*| 29. 10. | Iterative Compression for <typo fv:small-caps>Vertex Cover</typo>, <typo fv:small-caps>Feedback Vertex Set</typo> and <typo fv:small-caps>Odd Cycle Transversal</typo>, **[PA 4.1, 4.3.1, 4.4]** |
 | 5. 11. | //sport day - no class//|