Chevron Left
Zurück zu Approximation Algorithms Part I

Bewertung und Feedback des Lernenden für Approximation Algorithms Part I von École normale supérieure

4.7
Sterne
508 Bewertungen

Über den Kurs

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

Top-Bewertungen

DA

26. Jan. 2016

The course provides a high-level introduction to approximation algorithm. There is no programming assignments but it provides nice introduction to approximation algorithm.

MH

28. Mai 2020

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

Filtern nach:

1 - 25 von 102 Bewertungen für Approximation Algorithms Part I

von Mika M

23. Jan. 2016

von D. a

26. Jan. 2016

von Mursalin H

29. Mai 2020

von Mustafa Q

3. Jan. 2017

von Christophe C

12. Juni 2016

von Zitong W

16. Sep. 2017

von Swaprava N

27. Juni 2016

von Nihal B

5. Feb. 2016

von Zhouningnan

10. Jan. 2017

von Eoin M

18. Mai 2020

von Anupam G

19. Feb. 2020

von Ilya T

27. Aug. 2016

von Pavel V

8. Feb. 2016

von Jun Q

4. Dez. 2015

von Karthick S

26. Mai 2016

von Obinna O

15. Jan. 2016

von MANDADI S G

26. Okt. 2021

von Алексей К

17. Apr. 2016

von PodilaSaradaPriya

28. Okt. 2021

von Huynh L D

20. Jan. 2016

von Yoel

22. Mai 2016

von Deleted A

27. Dez. 2015

von POTHI R S

30. Sep. 2021

von Mukesh P

26. Sep. 2022

von Emanuel M

6. Nov. 2016