Параметризованные алгоритмы весна 2018 — различия между версиями
Материал из SEWiki
Bliznets (обсуждение | вклад) (→Практика) |
Bliznets (обсуждение | вклад) (→Лекции) |
||
| Строка 11: | Строка 11: | ||
** Odd Cycle transversal <math>O^*(4^k)</math>. Variable Deletion Almost 2-SAT. Feedback Vertex Set in Tournaments. Feedback Vertex Set. Odd Cycle Transversal <math>O^*(3^k)</math>. | ** Odd Cycle transversal <math>O^*(4^k)</math>. Variable Deletion Almost 2-SAT. Feedback Vertex Set in Tournaments. Feedback Vertex Set. Odd Cycle Transversal <math>O^*(3^k)</math>. | ||
*30 march. Randomized methods. | *30 march. Randomized methods. | ||
| + | *6 april. <math>O^*(4^k)</math> algorithm for $k$-path. Derandomization. | ||
== Практика == | == Практика == | ||
Версия 17:56, 13 апреля 2018
Преподаватель: Близнец Иван Анатольевич (iabliznets@gmail.com)
Лекции
- 16 february. Bounded search trees.
- FPT. Kernelization. Vertex Cover. Feedback Vertex Set. Closest String.
- 2 march. Kernelization.
- Feedback Arc Set in Tournaments. Edge Clique Cover. Crown Decomposition. Vertex Cover. Maximum Satisfiability.
- 16 march. Sunflower lemma. Kernelization for Vertex Cover using LP. Vertex Cover above LP branching.
- 23 march. Vertex Cover above Matching. Iterative Compression.
- Odd Cycle transversal . Variable Deletion Almost 2-SAT. Feedback Vertex Set in Tournaments. Feedback Vertex Set. Odd Cycle Transversal .
- 30 march. Randomized methods.
- 6 april. algorithm for $k$-path. Derandomization.
Практика
Надо оформить 5 самых сложных задач из Вами решенных.
- 2 march, "Kernelization."
- 2 march, "Kernelization(HW)."
- 16 march, "Kernelization II(HW)."
- 23 march, "Iterative Compression."
- 23 march, "Iterative Compression(HW)."
- 30 march, "Randomized methods."
- 30 march, "Randomized methods(HW)."
- 06 april, "Derandomization."
- 06 april, "Randomized methods and derandomization(HW)."
