Chevron Left
Volver a Approximation Algorithms Part II

Opiniones y comentarios de aprendices correspondientes a Approximation Algorithms Part II por parte de École normale supérieure

44 calificaciones

Acerca del Curso

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....

Principales reseñas


13 de mar. de 2016

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


15 de feb. de 2017

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

Filtrar por:

1 - 9 de 9 revisiones para Approximation Algorithms Part II

por Andrew P

28 de oct. de 2016

por Deleted A

1 de mar. de 2018

por Claus D M P

18 de ago. de 2016

por Maxime J

26 de feb. de 2017

por Zhouningnan

10 de ene. de 2017

por Refik A

14 de mar. de 2016

por Paulo E d V

16 de feb. de 2017

por Reynaldo G

4 de mar. de 2016

por victor g

21 de jul. de 2017