Chevron Left
Retour à Approximation Algorithms Part II

Avis et commentaires pour d'étudiants pour Approximation Algorithms Part II par École normale supérieure

44 évaluations

À propos du cours

Approximation algorithms, Part 2 This is the continuation of Approximation algorithms, Part 1. Here you will learn linear programming duality applied to the design of some approximation algorithms, and semidefinite programming applied to Maxcut. By taking the two parts of this course, you will be exposed to a range of problems at the foundations of theoretical computer science, and to powerful design and analysis techniques. Upon completion, you will be able to recognize, when faced with a new combinatorial optimization problem, whether it is close to one of a few known basic problems, and will be able to design linear programming relaxations and use randomized rounding to attempt to solve your own problem. The course content and in particular the homework is of a theoretical nature without any programming assignments. This is the second of a two-part course on Approximation Algorithms....

Meilleurs avis


13 mars 2016

It is remarkable to note that Professor Claire Mathieu explains such a complex subject in such a elegant and understandable manner.


15 févr. 2017

Even better than the first! Very good classes (except for the two first of week 3 ...)

Filtrer par :

1 - 9 sur 9 Avis pour Approximation Algorithms Part II

par Andrew P

28 oct. 2016

par Deleted A

1 mars 2018

par Claus D M P

18 août 2016

par Maxime J

26 févr. 2017

par Zhouningnan

10 janv. 2017

par Refik A

14 mars 2016

par Paulo E d V

16 févr. 2017

par Reynaldo G

4 mars 2016

par victor g

21 juil. 2017