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 |
Suggested Readings:
Lecturer:
Prof. Marco Bressan - Dipartimento di Informatica
Assessor:
Prof. Marco Bressan - Dipartimento di Informatica