Chevron Left
Back to Approximation Algorithms Part II

Learner Reviews & Feedback for Approximation Algorithms Part II by École normale supérieure

4.8
stars
44 ratings

About the Course

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

Top reviews

RA

Mar 13, 2016

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

PV

Feb 15, 2017

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

Filter by:

1 - 9 of 9 Reviews for Approximation Algorithms Part II

By Andrew P

Oct 28, 2016

By Deleted A

Mar 1, 2018

By Claus D M P

Aug 18, 2016

By Maxime J

Feb 26, 2017

By Zhouningnan

Jan 10, 2017

By Refik A

Mar 14, 2016

By Paulo E d V

Feb 16, 2017

By Reynaldo G

Mar 4, 2016

By victor g

Jul 21, 2017