Introduction to approximation algorithms. Neaproximovateľnosti term. Probabilistic analysis of algorithms and their complexity. Las Vegas and Monte Carlo. Integer linear programming. Overview of a hierarchy of complexity classes. Demonstrations on examples.

Type of methodology: Combination of lecture and hands-on

Participants receive the certificate of attendance: Yes

Paid training activity for participants: Yes, for all

Participants prerequisite knowledge: Numerical methods (linear algebra, statistics) Domain-specific background knowledge