VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
251-0424-00L
5
Credits
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.
Approximation: Theory and Algorithms
Approximation: Theorie & Algorithmen
Lecturers & Examiners:
Prof. Dr. Markus Bläser
Last Updated: 2026-02-05 15:02:40
Abstract
Introduction to the theory of approximation algorithms and complexity classes, examples include knapsack, bin packing, metric TSP, TSP in planar graphs, Euclidean TSP, Steiner trees; PCP-theorem, APX-reductions; LP relaxation.
General Information
- Language
- German
- Frequency
- Yearly recurring
Examination
- Type
- end-of-semester examination
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Approximation: Theorie und Algorithmen |
|
2 h weekly |
| exercise | Approximation: Theorie und Algorithmen |
|
1 h weekly |