Скачать или смотреть Parameterized Algorithms, Vertex Cover, Branching, Fixed-Parameter Tractability

We introduce the paradigm of parameterized algorithms. We cover the following topics this week:

1. An overview of the parameterized framework
2. An introduction to iterative compression via vertex cover
3. Using iterative compression to solve feedback vertex set

You can find course notes from here:

https://www.neeldhara.com/materials/a...

and practice problems from here:

https://www.neeldhara.com/courses/202...

These lectures are a part of the course ""Advanced Algorithms"" offered to students of the IITM online BS program. Enrolled students have access to additional assignments, live sessions, and a discussion forum.

Whether you are enrolled or not, you are welcome send any questions or feedback as comments on this video or via email to: [email protected]