π Exciting update! My Network Algorithms and Approximations course continues with Lessons 2, 3 & 4 now available! π
π Topics covered:
β
Submodular (Set) Cover β Greedy log-approximation & Group Steiner Tree
β
Maximum Coverage β 1 - 1/e approx, LP relaxations & budgeted coverage
β
Unique Coverage β Log(n)-approximation, NP-hardness & max-cut ties
π Watch now:
βΆοΈ Lesson 2: https://youtu.be/xi6P3bqy61g
βΆοΈ Lesson 3: https://youtu.be/jC44JdD74Hw
βΆοΈ Lesson 4: https://youtu.be/ypzFnl0Wfp4
π
New lectures premiere every Wednesday at 7PM ET!
πΊ Full playlist: https://www.youtube.com/playlist?list=PLx7SjCaKZzEIeJxOlTuXveAE5eY7WOYB9
π Subscribe for more: https://www.youtube.com/@hajiaghayi
#Optimization #Algorithms #NetworkDesign #CombinatorialOptimization #MachineLearning #GraphTheory #SetCover #ApproximationAlgorithms