Chevron Left
Volver a Approximation Algorithms Part I

Opiniones y comentarios de aprendices correspondientes a Approximation Algorithms Part I por parte de École normale supérieure

4.7
estrellas
487 calificaciones

Acerca del Curso

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

Principales reseñas

DA

26 de ene. de 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 de may. de 2020

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

Filtrar por:

1 - 25 de 100 revisiones para Approximation Algorithms Part I

por Mika M

23 de ene. de 2016

por D. a

26 de ene. de 2016

por Mursalin H

29 de may. de 2020

por Mustafa Q

3 de ene. de 2017

por Christophe C

12 de jun. de 2016

por Zitong W

16 de sep. de 2017

por Swaprava N

27 de jun. de 2016

por Nihal B

5 de feb. de 2016

por Zhouningnan

10 de ene. de 2017

por Eoin M

18 de may. de 2020

por Anupam G

19 de feb. de 2020

por Ilya T

27 de ago. de 2016

por Pavel V

8 de feb. de 2016

por Jun Q

4 de dic. de 2015

por Karthick S

26 de may. de 2016

por Obinna O

15 de ene. de 2016

por MANDADI S G

26 de oct. de 2021

por Aliaksei K

17 de abr. de 2016

por PodilaSaradaPriya

28 de oct. de 2021

por Huynh L D

20 de ene. de 2016

por Yoel

22 de may. de 2016

por Deleted A

27 de dic. de 2015

por POTHI R S

30 de sep. de 2021

por MUKESH P P

26 de sep. de 2022

por Emanuel M

6 de nov. de 2016