学生对 École normale supérieure 提供的 Approximation Algorithms Part I 的评价和反馈
课程概述
热门审阅
BW
Sep 16, 2017
This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.
AK
Apr 16, 2016
A really good course for programmers who want to take a bit deeper into CS.
1 - Approximation Algorithms Part I 的 25 个评论(共 110 个)
创建者 Mika M
•Jan 23, 2016
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
•Jan 26, 2016
The course provides a high-level introduction to approximation algorithm. There is no programming assignments but it provides nice introduction to approximation algorithm.
创建者 Mursalin H
•May 29, 2020
A great course if you want to learn about approximation algorithms from the point of view of linear programming relaxation!
创建者 Mustafa Q
•Jan 3, 2017
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.
创建者 Christophe C
•Jun 12, 2016
Excellent advanced course! Not for beginner in computer science, nor for people more interested in applying computer science than in theoretical foundations.
创建者 beetroot w
•Sep 16, 2017
This course is awesome. Prof. managed to elaborate the problem and analysis clearly and homework is properly assigned.
创建者 Swaprava N
•Jun 27, 2016
This was a relatively easy but well paced introduction to approximation algorithms. I totally enjoyed it.
创建者 Nihal B
•Feb 5, 2016
A useful course which introduces key ideas in Approximation Algorithms. Looking forward to part II.
创建者 Zhouningnan
•Jan 10, 2017
This class is very clear and easy to understand! Thank you for providing such feast for students!
创建者 Eoin M R
•May 18, 2020
Fantastic course! Can't wait to do part ii
创建者 Ricardo M C
•Jun 2, 2016
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.
创建者 Anupam G
•Feb 19, 2020
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).
创建者 Ilya T
•Aug 27, 2016
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.
创建者 Pavel V
•Feb 8, 2016
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!
创建者 Jun Q
•Dec 4, 2015
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.
创建者 Karthick S
•May 26, 2016
Excellent Course! I have learnt a lot about Approximation Algorithms in a short span of time.
创建者 Obinna O
•Jan 15, 2016
awesome course!
I'd like to see part 2 and other graduate-level algorithms courses on coursera.
创建者 Mandadi S G
•Oct 26, 2021
Excellent Course Really helped me to have an in depth knowledge in every concept
创建者 Aliaksei K
•Apr 16, 2016
A really good course for programmers who want to take a bit deeper into CS.
创建者 PodilaSaradaPriya
•Oct 28, 2021
course is good .But certificate is not available please reverify it once
创建者 Yoel
•May 22, 2016
Great class, and Professor Claire Mathieu is doing an excellent job!
创建者 Deleted A
•Dec 27, 2015
very nice course. i look forward to the second part!
创建者 Pothi R S
•Sep 30, 2021
It's Wonderful and easy to understand the concept
创建者 Mukesh
•Sep 26, 2022
excellent course and I have learned many things