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

Отзывы учащихся о курсе Approximation Algorithms от партнера EIT Digital

Оценки: 29

О курсе

Many real-world algorithmic problems cannot be solved efficiently using traditional algorithmic tools, for example because the problems are NP-hard. The goal of this course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. These techniques apply when we don't require the optimal solution to certain problems, but an approximation that is close to the optimal solution. We will see how to efficiently find such approximations. Prerequisites: In order to successfully take this course, you should already have a basic knowledge of algorithms and mathematics. Here's a short list of what you are supposed to know: - O-notation, Ω-notation, Θ-notation; how to analyze algorithms - Basic calculus: manipulating summations, solving recurrences, working with logarithms, etc. - Basic probability theory: events, probability distributions, random variables, expected values etc. - Basic data structures: linked lists, stacks, queues, heaps - (Balanced) binary search trees - Basic sorting algorithms, for example MergeSort, InsertionSort, QuickSort - Graph terminology, representations of graphs (adjacency lists and adjacency matrix), basic graph algorithms (BFS, DFS, topological sort, shortest paths) The material for this course is based on the course notes that can be found under the resources tab. We will not cover everything from the course notes. The course notes are there both for students who did not fully understand the lectures as well as for students who would like to dive deeper into the topics. The video lectures contain a few very minor mistakes. A list of these mistakes can be found under resources (in the document called "Errata"). If you think you found an error, report a problem by clicking the square flag at the bottom of the lecture or quiz where you found the error....

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

Фильтр по:

1–8 из 8 отзывов о курсе Approximation Algorithms

автор: Suryendu D

18 июля 2020 г.

The course was no doubt excellent. At the end of the day you are going to earn a mouth watering certificate signed by one of the best computer scientists in the world. Prof. Mark de Berg. Professor speaks english very well and hence no one will face any problem related to language. Also professor taught the course extremely well. But unfortunately this course is completely inactive. All the questions in discussion forums remains unanswered. There was a problem is Week 2 Assignment 'PTAS for Load Balancing', where your correct answer will be considered wrong. Mentors of this course are sitting idle. They do not provide any assistance to the students. This course really needs a mentor who is active.

автор: 김동윤

4 мая 2021 г.

Short but compact course that discusses important topics. The quizes and programming homeworks are challenging enough to help to check your studying procedure. Prof. Mark de Berg is an amazing instructor and gives clear lecture videos. One small tip will be to check the Errata sheet before studying. Overall a compact and helpful course.

автор: ChocolateCharlie

23 нояб. 2020 г.

Nice introductory course which combines both theory and practice. Though these algorithms are covered in the course, a previous experience with greedy algorithms and dynamic programming might be helpful.

автор: Jakob B

27 янв. 2021 г.

Excellent short course on approximation algorithms. Good course material, presentations and exercises.

автор: 周柏宇

13 авг. 2020 г.

A great introductory course to the approximation algorithms.

автор: Chee H C

11 сент. 2020 г.

Great course.

автор: Shailesh M

11 окт. 2020 г.

Please try to include some more numeric example like load balancing problem in the vertex cover and rest topics

автор: Lorenzo P

25 февр. 2021 г.

Very good course! A nice introduction to approximation algorithms.