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

Материал из SEWiki
Перейти к: навигация, поиск
(Практика)
(Лекции)
Строка 13: Строка 13:
 
*6 april. <math>O^*(4^k)</math> algorithm for k-path. Derandomization.
 
*6 april. <math>O^*(4^k)</math> algorithm for k-path. Derandomization.
 
*13 april. Dynamic programming over subsets. Integer linear programming. Graph minors and Robertson-Seymour theorem.
 
*13 april. Dynamic programming over subsets. Integer linear programming. Graph minors and Robertson-Seymour theorem.
*20 april. Important cuts.
+
*20 april. Important cuts. Edge Multiway Cut.
 +
*20 april. Important cuts in Directed graphs. Directed Feedback Vertex Set.
  
 
== Практика ==
 
== Практика ==

Версия 23:56, 1 мая 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.
  • 20 april. Important cuts in Directed graphs. Directed Feedback Vertex Set.

Практика

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