🚀 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