Chevron Left
Approximation Algorithms Part II に戻る

Approximation Algorithms Part II, エコール・ノルマル・シュペリウール(École normale supérieure)



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


by AP

Oct 28, 2016

Demanding course with lots of great algorithm concepts based on Linear Programming.

by DA

Mar 01, 2018

I really appreciate your valuable knowledge sharing. This is a perfect course.



by Deleted Account

Mar 01, 2018

I really appreciate your valuable knowledge sharing. This is a perfect course.

by victor guillot

Jul 21, 2017

A very synthetic course on the topic.Explanations are of great quality and elegant!

Every algorithms given are analysed on a mathematical point of view.

ENS should enable people to get certificate for this course ! I would prefer

give money to this top institution in theorical science than to the huge private universities

To improve : the commitment of the staff to the forum

by Maxime Jaubert

Feb 26, 2017

Excellente course, thank you for the excellent techniques and approach that often lacks in courses on the subject.

I would have loved a validation at least.

I'd be very happy to attend another of your class should you make a part 3 or another lecture.

by Paulo Emílio de Vilhena

Feb 16, 2017

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

by Zhouningnan

Jan 11, 2017

Learning Approximation algorithm by self is really hard. Fortunately this class is very easy to understand useful techniques such as primal-dual linear programming and SDP. Thank you very much!

by Andrew Panufnik

Oct 28, 2016

Demanding course with lots of great algorithm concepts based on Linear Programming.

by Claus D. Makowka, PhD

Aug 19, 2016

This course covers challenging technical topics and I appreciate that the effort that went into making it. That said I have serious concerns about the quality of execution for Part II of the course, which was much inferior to part I of the course.

In general, the lectures themselves were up to the quality of part I and are well done. In many cases, the practice quizzes were less helpful. Including one sequence where each quiz extended the previous one but if you there was no way to learn from your errors, especially an error in the first quiz.

For the peer graded assignments, there was one answer field for multiple questions, rather than one per question. Worse, the answers often required equations and LaTex math was not available. The only solution was to put the answers in a document on a cloud drive like Google Drive and paste a link in. Finally, for the peer review you could just mark questions correct or wrong with no way to provide private feedback on what was lacking in a response. Furthermore, doing the peer review was purely optional and the results were not actually scored. (Part 1 was similar, but it was possible to upload the document to Coursera directly and peer review was a required part of the course, resulting in a grade.) Either there are serious limitations with this iteration of the Coursera platform or the course authors did not understand how to properly implement this.

Finally, in the session I took their was no active Teaching Assistance presence. There were no responses to student questions nor concerns that were raised about typos and possible errors in the quizzes and problem assignments. Either the course should not have been offered if no TA support was available or there should have been some notification in syllabus that this session would only have peer assistance with no support from the course staff.

by Refik Arkut

Mar 14, 2016

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

by Reynaldo Gil-Pons

Mar 04, 2016