Chevron Left
Back to Approximation Algorithms Part I

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

4.7
stars
552 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:

51 - 75 of 110 Reviews for Approximation Algorithms Part I

By Kaustubh M

•

Oct 17, 2021

awesome

By Ajay.S

•

Sep 10, 2024

super

By Guruju G S K

•

Sep 16, 2022

good

By Siddu R

•

Oct 21, 2021

noice

By Rishav k

•

Oct 13, 2021

ossum

By manne b p

•

Oct 6, 2021

nice

By mithlesh g

•

Jun 19, 2024

nice

By KOTTE K

•

Apr 5, 2023

good

By KUNAMNENI J

•

Mar 6, 2023

good

By Bobba K

•

Feb 22, 2023

good

By ASADUR Z N

•

Oct 4, 2022

hyh

By Yuvaraj G

•

Sep 23, 2022

bad

By TIRUVEEDULA S H

•

Nov 9, 2021

good

By Shaik S A

•

Nov 2, 2021

good

By Mallempudi S

•

Nov 1, 2021

good

By Durgasaikiran T

•

Nov 1, 2021

GOOD

By MEKALA N K Y

•

Oct 31, 2021

good

By Doondy S K C

•

Oct 29, 2021

good

By Ajay k

•

Oct 29, 2021

Good

By Madhava S C

•

Oct 27, 2021

Good

By Raghava R

•

Oct 26, 2021

GOOD

By CHALASANI C

•

Oct 23, 2021

none

By RITWIKA G

•

Oct 23, 2021

good

By Pannem Y B

•

Oct 21, 2021

good

By vishwajeet s

•

Oct 14, 2021

Good