NDMI084 - Introduction to Approximation and Randomized Algorithms
This is the practical class for
the lecture by doc. Kolman.
The practicals take place every even wednesday of the semester starting at 9:00 in S6.
Information for the Czech practicals can be found here.
I recommend Design of Approximation Algorithms as a study material. Section 1.2 contains a relatively good introduction to linear programming.
Conditions for passing the practicals
There will be ten homework tasks over the course of the semester (so roughly two on each practical), each worth four points.
You need to earn at least 25 of the 40 possible points.
You have at least two weeks to complete each task.
Submit your homework using the Postal Owl.
Deadlines for the english practicals are one week after the deadline displayed in Owl.
The tasks can be found on worksheets from individual practicals.
Worksheets
2023-10-11
Worksheet
2023-10-25
Worksheet
2023-11-08
Worksheet
2023-11-22
Worksheet
2023-12-06
Worksheet
2023-12-20
Worksheet
2024-01-10
Worksheet