Course for international guest/part time students
- Faculty
- Faculty of Science
- Organization
- TTK Department of Operations Research
- Code
- appalg1u0um17em
- Title
- Approximation algorithms (l)
- Usual semester
- Spring
- Published semester
- 2025/26/2
- ECTS
- 3
- Language
- en
- Learning outcomes
- Knowledge: getting familiar with the main notions of approximation algorithms Ability: to understand and use approximation algorithms Attitude: the need to deepen the applied mathematical knowledge, to gain new applied mathematical skills, to develop competencies. Aspiration to apply the mathematical knowledge for a wide range of problems Autonomy and Responsibility: based on the gained knowledge in approximation algorithms, the students are able to decide which tools are the most suitable to solve applied problems
- Course content
- Set cover, vertex cover, traveling salesman problem, Steiner trees, LP relaxations, primal-dual algorithms, feedback vertex set, bin packing, source location. Scheduling, k-center, k-cut, multicut. Multicommodity flows. Minimum k-connected subgraph.
- Assessment method
- exam
- Bibliography
- lecture notes