Rozdíly

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

--- teaching:para1920 [2020/06/15 08:03] – [Parameterized algorithms for IP and applications] Martin Koutecky
+++ teaching:para1920 [2022/05/09 20:33] (aktuální) – [Parameterized Approximations for Steiner Trees] Martin Koutecky
@@ Řádek 33: / Řádek 33: @@
   - Proof of Borchers and Du Theorem: sections 1 and 3 of [[https://epubs.siam.org/doi/pdf/10.1137/S0097539795281086|Borchers and Du]]
   - Directed Steiner Tree parameterized by nr of Steiner vertices: sections 1, 4, and 5 of [[https://arxiv.org/pdf/1710.00668.pdf|Dovřak et al.]]
-  - Undirected Steiner Tree (and Steiner Forest) parameterized by nr of Steiner vertices (and nr of connected components): sections 1 and 3 of [[https://arxiv.org/pdf/1710.00668.pdf|Dovřak et al.]]
+  - Undirected Steiner Tree (and Steiner Forest) parameterized by nr of Steiner vertices (and nr of connected components): sections 1 and 3 of [[https://arxiv.org/pdf/1710.00668.pdf|Dvořak et al.]]