Chevron Left
Retour à Approximation Algorithms Part I

Avis et commentaires pour d'étudiants pour Approximation Algorithms Part I par École normale supérieure

4.7
étoiles
486 évaluations

À propos du cours

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

Meilleurs avis

DA

26 janv. 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!

Filtrer par :

1 - 25 sur 99 Avis pour Approximation Algorithms Part I

par Mika M

23 janv. 2016

par D. a

26 janv. 2016

par Mursalin H

29 mai 2020

par Mustafa Q

3 janv. 2017

par Christophe C

12 juin 2016

par Zitong W

16 sept. 2017

par Swaprava N

27 juin 2016

par Nihal B

5 févr. 2016

par Zhouningnan

10 janv. 2017

par Eoin M

18 mai 2020

par Anupam G

19 févr. 2020

par Ilya T

27 août 2016

par Pavel V

8 févr. 2016

par Jun Q

4 déc. 2015

par Karthick S

26 mai 2016

par Obinna O

15 janv. 2016

par MANDADI S G

26 oct. 2021

par Aliaksei K

17 avr. 2016

par PodilaSaradaPriya

28 oct. 2021

par Huynh L D

20 janv. 2016

par Yoel

22 mai 2016

par Deleted A

27 déc. 2015

par POTHI R S

30 sept. 2021

par MUKESH P P

26 sept. 2022

par Emanuel M

6 nov. 2016