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 |
Contents
- 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
- Face to face
Term 1 Assessment - type
- N/A
Term 1 Assessment - comments
Not applicable
Term 2 Assessment - type
- Oral Examination
Term 2 Assessment - comments
Oral examination 100% (theory 70%, exercices 30%)
Term 3 Assessment - type
- Oral examination
Term 3 Assessment - comments
Oral examination 100% (theory 70%, exercices 30%)
Resit Assessment - Term 1 (B1BA1) - Comments
Not applicable
Type of Teaching Activity/Activities
- Cours (cours magistraux; conférences)
- Exercices dirigés / utilisation de logiciels / démonstrations