Learner Reviews & Feedback for Approximation Algorithms Part I by École normale supérieure
About the Course
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 ...
Top reviews
DA
Jan 27, 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 29, 2020
A great course if you want to learn about approximation algorithms from the point of view of linear programming relaxation!
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 30, 2021
good
By Ajay k
•Oct 29, 2021
Good
By Madhava S C
•Oct 27, 2021
Good
By Raghava R
•Oct 27, 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