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

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

Оценки: 304
Рецензии: 61

О курсе

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 nature without any programming assignments. This is the first of a two-part course on Approximation Algorithms....

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

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.

28 мая 2020 г.

A great course if you want to learn about approximation algorithms from the point of view of linear programming relaxation!

Фильтр по:

26–50 из 60 отзывов о курсе Approximation Algorithms Part I

автор: Prahasith N

30 сент. 2021 г.

it is more helpfull

автор: Zhenwei L

15 авг. 2019 г.

I love this course!

автор: Paulo E d V

13 февр. 2017 г.

Great course!

автор: MANTUR V R

8 окт. 2021 г.

very usefull

автор: RITHVIK V S D

9 окт. 2021 г.

good course

автор: Roberto p g j

21 сент. 2017 г.

Very good !

автор: Pasquale D M

30 мая 2017 г.

super cool!

автор: Pierre-Cyrille H

23 июня 2016 г.


автор: Kaustubh M

17 окт. 2021 г.


автор: AMBATI S

7 окт. 2021 г.


автор: Rishav k

13 окт. 2021 г.


автор: manne b p

6 окт. 2021 г.


автор: vishwajeet s

14 окт. 2021 г.


автор: Madhavi I

14 окт. 2021 г.


автор: KONDA S V

10 окт. 2021 г.


автор: SANAPA T P

9 окт. 2021 г.


автор: 2000030091 b s h

8 окт. 2021 г.


автор: IRAGALA A

8 окт. 2021 г.


автор: Navya K

30 сент. 2021 г.


автор: KIRLA J U N

30 сент. 2021 г.


автор: NANDA K K

30 сент. 2021 г.


автор: Claus D M P

4 авг. 2016 г.

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.

автор: victor g

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

автор: Abhijit O

21 окт. 2016 г.

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.

автор: Mingda Q

21 февр. 2016 г.

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.