Claire Mathieu
Approximation algorithms, Part I How efficiently can you pack objects into a minimum number of boxes? How well can you cluster nodes so as to cheaply separate a network into components around a few centers? These are examples of NP–hard combinatorial optimization problems. It is most likely impossible to solve such problems efficiently, so our aim is to give an approximate solution that can be computed in polynomial time and that at the same time has provable guarantees on its cost relative to the optimum. This course assumes knowledge of a standard undergraduate Algorithms course, and particularly emphasizes algorithms that can be designed using linear programming, a favorite and amazingly successful technique in this area. By taking 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 …
Instructor Details
Courses : 2
Specification: Approximation Algorithms Part I
|
34 reviews for Approximation Algorithms Part I
Add a review
| Provider | |
|---|---|
| Duration | 23 hours |
| Year | 2015 |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
Jun Q –
This class is the one I am seeking for a long time. Theories of Combinatorial optimization and associated approximation algorithms involve lots of hot research topics in machine learning, image processing, and Bioinformatics. The faculty for this course is a leading expert in the related fields.
Deleted A –
very nice course. i look forward to the second part!
Obinna O –
awesome course! I’d like to see part 2 and other graduate level algorithms courses on coursera.
Vivek A –
This course is quite advanced and the assignments require prerequisite skills to prove time complexity etc. If you are upto it, then for sure take this course. The instructor is quite thorough.
Do H L –
Very high level course. After week1 and I’m already excited to start it
Mika M –
The course deals not with programming, but rather with designing and analyzing approximation algorithms. The course is on a high level and focuses on the subject without too much side remarks on applications, connections to other subjects or motivational introductions. If you are a theory person, however, you will probably enjoyed it.
D. a –
The course provides a high level introduction to approximation algorithm. There is no programming assignments but it provides nice introduction to approximation algorithm.
Nihal B –
A useful course which introduces key ideas in Approximation Algorithms. Looking forward to part II.
Pavel V –
Really good course, the material is quite advanced but very well structured and introduced in a very simple way. The assignments were a lot of fun: really enjoyed the peer graded assignments where I needed to write short proofs, much more useful than regular multiple choice answers. Looking forward to the next course!
Mingda Q –
Lectures are well organized. Some assignments (e.g., Assignment 3, which involves merely understanding an algorithm, rather than proving correctness and approx. ratio) are extraordinarily stupid and somewhat tangential.
Aliaksei K –
A really good course for programmers who want to take a bit deeper into CS.
Joel K –
Great class, and Professor Claire Mathieu is doing an excellent job!
Karthick S –
Excellent Course! I have learnt a lot about Approximation Algorithms in a short span of time.
Ricardo M C –
This course covers the basic ground about approximation algorithms and would be very valuable for a practitioner, but seems designed for people who already know the materials and is more theoretical than applied. Lectures are very abstract with a description of the problem and a formal description of the solution , there are few examples with step by step tracing of algorithms that is how the algorithm actually works to solve the problem , and a significant amount of expertise is assumed so much so, that you wouldn’t need this course. For example, there are questions about “approximation ratio”, but it is not explained. This seems like something that is inherent to approximation algorithms, but is only asked in the exams/project, and is not even mentioned in the lectures. Similar issues abound around the course.
Christophe C –
Excellent advanced course! Not for beginner in computer science, nor for people more interested in applying computer science than in theoretical foundations.
Pierre Cyrille H –
Excellent!
Swaprava N –
This was a relatively easy but well paced introduction to approximation algorithms. I totally enjoyed it.
Claus D M P –
Lectures and content were great. The theme of the course is to provide insight into the approaches used to investigate approximation algorithms for NP hard problems and the theoretical techniques used to assess the effectiveness of the approximation algorithm against the best answer. The production quality of the lecture videos and slides was high. The content of the quizzes and assignments was mostly appropriate and well organized. However, the authors appeared to struggle with the platform. At times there were comments such as, you need to enter something in the box but it was not actually being used. Answers to the assignments required using substantial mathematical notation, but LaTex was not enabled in the discussion or text entry boxes (no longer available in the Coursera platform??) so the work around was to upload answers to a bunch of questions as a single PDF document. Flow of the individual modules (lectures, slides, quizzes) was inconsistent, varying from week to week.
Philippe S –
Very interesting, explanations are clear and easy to understand
Ilya T –
The assignments could be a bit improved (some are less good, I would personally complain about knapsack), but in general it is a great course, as it gives an accessible introduction to approximation algorithms (for NP hard problems), which is a very relevant topic, as NP hard problems are everywhere. At the time of writing (end summer 2016), it is also a unique course for this very relevant topic.
Abhijit O –
Content of the course is great. However , at time assignments are very difficult to understand. There are probably very few students who take this course at any time , so you dont get much help from forums. TA’s and Professor as well have not responded to any of our questions. I dont expect any course to be cakewalk but at least some help need to be provided.
Emanuel M –
good course, with many examples and explanations
Mustafa Q –
I love how this course delves into a very promising advanced research topic in Computational Complexity. It helps me a lot to understand trending publications in the area. Specially that the material is presented in an incremental approach. This way a researcher can live through the evolution of ideas. It is inspiring also in the way one comes up with a partial solution for the special case, and then generalizes with approximation factor that is satisfyingly good. I’m looking forward to more advanced courses in parameterized, streaming or quantum algorithms.
Susanne W –
Zhouningnan –
This class is very clear and easy to understand! Thank you for providing such feast for students!
Paulo E d V –
Great course!
Pasquale D M –
super cool!
Peter U –
The content of the course is good and the lectures even better. However the quizzes and homeworks could use an update or refresh. The forums connected to the course is a ghosttown.
victor g –
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
Antonio C –
Really good course and Professor.
Zitong W –
This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.
Roberto P G J –
Very good !
Anupam G –
I am a researcher and (in past) an instructor in SDP, Randomized and Approximation Algorithms. There are a few instances, where things are not explained as well as an advanced UG or a starting Grad student would like, e.g., Knapsack got a bit delirious somewhere in between (the “special special” case, which IMHO was not needed.) Otherwise, I love Claire’s enthusiasm, and the joy she finds in delivering the ideas. She is succinct everywhere (to me).
Zhenwei L –
I love this course!