Study programme | Français | ||
Approximation Algorithms | |||
Activité d'apprentissage à la Faculty of Science |
Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
---|---|---|---|
S-INFO-021 |
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
---|---|---|---|---|---|---|---|
Français | Français | 30 | 15 | 0 | 0 | 0 | Q2 |
Content of Learning Activity
- complexity of optimization problems
- design techniques for approximation algorithms
- approximation classes
- input-dependent and asymptotic approximation
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
- Williamson, Shmoys, The Design of Approximation Algorithms, Cambridge University Press (2011). Electronic version available online: www.designofapproxalgs.com
- Ausiello, Crescenzi, Gambozi, Kann, Marchetti-Spaccamela, Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer (1999)
- Vazirani, Approximation Algorithms, Springer (2001)
Mode of delivery
Type of Teaching Activity/Activities
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)