Chevron Left
Back to Approximation Algorithms Part I

Learner Reviews & Feedback for Approximation Algorithms Part I by École normale supérieure

4.7
stars
489 ratings

About the Course

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 reviews

DA

Jan 26, 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

May 28, 2020

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

Filter by:

1 - 25 of 101 Reviews for Approximation Algorithms Part I

By Mika M

Jan 23, 2016

By D. a

Jan 26, 2016

By Mursalin H

May 29, 2020

By Mustafa Q

Jan 3, 2017

By Christophe C

Jun 12, 2016

By Zitong W

Sep 16, 2017

By Swaprava N

Jun 27, 2016

By Nihal B

Feb 5, 2016

By Zhouningnan

Jan 10, 2017

By Eoin M

May 18, 2020

By Anupam G

Feb 19, 2020

By Ilya T

Aug 27, 2016

By Pavel V

Feb 8, 2016

By Jun Q

Dec 4, 2015

By Karthick S

May 26, 2016

By Obinna O

Jan 15, 2016

By MANDADI S G

Oct 26, 2021

By Aliaksei K

Apr 17, 2016

By PodilaSaradaPriya

Oct 28, 2021

By Huynh L D

Jan 20, 2016

By Yoel

May 22, 2016

By Deleted A

Dec 27, 2015

By POTHI R S

Sep 30, 2021

By MUKESH P P

Sep 26, 2022

By Emanuel M

Nov 6, 2016