Параметризованные алгоритмы весна 2018

Материал из SEWiki
Перейти к: навигация, поиск

Преподаватель: Близнец Иван Анатольевич (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.

Практика

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