Параметризованные алгоритмы весна 2018 — различия между версиями

Материал из SEWiki
Перейти к: навигация, поиск
(Лекции)
(Практика)
Строка 33: Строка 33:
 
*[[Медиа:FPT-class-9.pdf|27 april, "Important cuts II."]]
 
*[[Медиа:FPT-class-9.pdf|27 april, "Important cuts II."]]
 
*[[Медиа:FPT-home-9.pdf|27 april, "Important cuts II(HW)."]]
 
*[[Медиа:FPT-home-9.pdf|27 april, "Important cuts II(HW)."]]
 +
*[[Медиа:FPT-class-10.pdf|03 may, "W[1], W[2]."]]
 +
*[[Медиа:FPT-class-10.pdf|03 may, "W[1], W[2](HW)."]]

Версия 16:03, 9 мая 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.
  • 13 april. Dynamic programming over subsets. Integer linear programming. Graph minors and Robertson-Seymour theorem.
  • 20 april. Important cuts. Edge Multiway Cut.
  • 27 april. Important cuts in Directed graphs. Directed Feedback Vertex Set.

Практика

Надо оформить 5 самых сложных задач из Вами решенных.