Length: 15 hours - 3 cfu
Abstract
The course will provide students with a basic understanding of parameterized algorithms and parameterized complexity. The students will learn essential techniques for building fixed-parameter tractable (FPT) algorithms for some NP-hard problems, as well as fundamental concepts about parameterized complexity and fixed-parameterized (in)tractability.
For notes and material see the lecturer's course page: https://sites.google.com/view/marco-bressan/fpt-course
| Giorni | Aula | Orario |
| 15/03/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan |
09:30-12:30 |
| 17/03/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan |
09:30-12:30 |
| 20/03/2023 | Lab. Laurea Magistrale 5° floor - Via Celoria 18 - 20133 Milan |
09:30-12:30 |
| 22/03/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan | 09:30-12:30 |
| 24/03/2023 | Lab. Laurea Magistrale 3° floor - Via Celoria 18 - 20133 Milan | 09:30-12:30 |