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.
Dates & Venue
| Giorni | Aula | Orario |
| 19/03/2025 | Lab Laurea Magistrale - 3° floor - Via Celoria, 18 - 20133 Milan | 10:00 - 13:00 |
| 21/03/2025 | Lab Laurea Magistrale - 3° floor - Via Celoria, 18 - 20133 Milan | 10:00 - 13:00 |
| 24/03/2025 | Lab Laurea Magistrale - 5° floor - Via Celoria, 18 - 20133 Milan | 10:00 - 13:00 |
| 26/03/2025 | Lab Laurea Magistrale - 3° floor - Via Celoria, 18 - 20133 Milan | 10:00 - 13:00 |
| 28/03/2025 | Lab Laurea Magistrale - 3° floor - Via Celoria, 18 - 20133 Milan | 10:00 - 13:00 |
Course Material:
https://sites.google.com/view/marco-bressan/home/fpt-course
Lecturer:
Prof. Marco Bressan - Dipartimento di Informatica
Assessor:
Prof. Marco Bressan - Dipartimento di Informatica