Chevron Left
Voltar para Approximation Algorithms Part I

Comentários e feedback de alunos de Approximation Algorithms Part I da instituição Escola Normal Superior de Paris

4.7
estrelas
472 classificações
95 avaliações

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

Melhores avaliações

DA
26 de Jan 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 Mai de 2020

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

Filtrar por:

51 — 75 de 94 Avaliações para o Approximation Algorithms Part I

por Mallempudi S

1 de Nov de 2021

good

por THOTA D S K

1 de Nov de 2021

GOOD

por MEKALA N K Y

31 de Out de 2021

good

por Doondy s k C

29 de Out de 2021

good

por Ajay k

29 de Out de 2021

Good

por Madhava S C

27 de Out de 2021

Good

por ragi r

26 de Out de 2021

GOOD

por CHALASANI C

23 de Out de 2021

none

por Ritwika g

23 de Out de 2021

good

por PANNEM Y B

21 de Out de 2021

good

por VISHWAJEET S

14 de Out de 2021

Good

por Madhavi I

14 de Out de 2021

good

por KONDA S V

10 de Out de 2021

good

por Thanooj P

9 de Out de 2021

cool

por 2000030091 b s h

8 de Out de 2021

best

por IRAGALA A

8 de Out de 2021

cool

por Navya K

30 de Set de 2021

good

por KIRLA J U N

30 de Set de 2021

GOOD

por NANDA K K

30 de Set de 2021

good

por potu R

27 de Nov de 2021

yea

por Polamarasetty V V n

5 de Nov de 2021

NO

por Sreeja P

30 de Out de 2021

NA

por Thatavarthi S H

27 de Out de 2021

nn

por Shayan m

20 de Out de 2021

hh

por Boggarapu Y

21 de Out de 2021

5