Parameterized complexity 2026: различия между версиями
Перейти к навигации
Перейти к поиску
Bauwens (обсуждение | вклад) Нет описания правки |
Bauwens (обсуждение | вклад) Нет описания правки |
||
| (не показано 8 промежуточных версий этого же участника) | |||
| Строка 1: | Строка 1: | ||
Course name: parameterized algorithms and complexity | |||
Teacher: [https://www.hse.ru/en/org/persons/160550073/ Bruno Bauwens] | |||
First lecture Sept 8th! | |||
Lecture: Tuesday 9h30 -- 10h50 in D510 on sept 8th | |||
Seminar: Tuesday 11h10 -- 12h30 in R405 on sept 8th | |||
Both in class and in [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]. For attending on zoom, you must switch on the camera. | |||
Invite link for [https://t.me/+W06Zh3z0m7I5YzVk telegram group] for questions about materials and practical issues. | |||
[https://drive.google.com/drive/folders/18tjWNSbQ4Ub1U2UJus1PuxOBdSZtrVOn?usp=sharing syllabus], with all information, reference books, ... | |||
{| class="wikitable" | |||
|+ Table Caption (Optional) | |||
! Date !! topic !! notes !! problem list ! | |||
|- | |||
| 08 sept || Classes FPT and XP, examples, kernels, vertex cover in time 1.4645^k k^{O(1)} + n^{O(1)} || [https://drive.google.com/file/d/1IGxLXXjHuM8aJ_V9NILyzukxlU1qSgA5/view?usp=drive_link 01_notes.pdf] || [[https://drive.google.com/file/d/1mM06XVgxf4yNA4_27JYGCFOPoKFQFTgy/view?usp=drive_link 01problems] | |||
|- | |||
| 15 sept || No lecture while students are still subscribing || || | |||
|- | |||
| 22 sept || More vertex cover kernels: cut degree ≤ 3 nodes, linear programming (Nemhauser-Trotter thm + fast algorithm). A Kernel for set cover. || || | |||
|} | |||
Текущая версия от 15:08, 9 сентября 2026
Course name: parameterized algorithms and complexity
Teacher: Bruno Bauwens
First lecture Sept 8th!
Lecture: Tuesday 9h30 -- 10h50 in D510 on sept 8th
Seminar: Tuesday 11h10 -- 12h30 in R405 on sept 8th
Both in class and in zoom. For attending on zoom, you must switch on the camera.
Invite link for telegram group for questions about materials and practical issues.
syllabus, with all information, reference books, ...
| Date | topic | notes | problem list ! |
|---|---|---|---|
| 08 sept | Classes FPT and XP, examples, kernels, vertex cover in time 1.4645^k k^{O(1)} + n^{O(1)} | 01_notes.pdf | [01problems |
| 15 sept | No lecture while students are still subscribing | ||
| 22 sept | More vertex cover kernels: cut degree ≤ 3 nodes, linear programming (Nemhauser-Trotter thm + fast algorithm). A Kernel for set cover. |