Chevron Left
Вернуться к Approximation Algorithms Part II

Отзывы учащихся о курсе Approximation Algorithms Part II от партнера Высшая нормальная школа

Оценки: 44

О курсе

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

Лучшие рецензии


13 мар. 2016 г.

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


15 февр. 2017 г.

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

Фильтр по:

1–9 из 9 отзывов о курсе Approximation Algorithms Part II

автор: Andrew P

28 окт. 2016 г.

автор: Deleted A

1 мар. 2018 г.

автор: Claus D M P

18 авг. 2016 г.

автор: Maxime J

26 февр. 2017 г.

автор: Zhouningnan

10 янв. 2017 г.

автор: Refik A

14 мар. 2016 г.

автор: Paulo E d V

16 февр. 2017 г.

автор: Reynaldo G

4 мар. 2016 г.

автор: victor g

21 июля 2017 г.