Master algorithmic techniques for solving NP-hard optimization problems with provable performance guarantees. Learn linear programming relaxations, greedy methods, and randomized approaches through courses on Coursera and specialized lectures on YouTube from leading computer science researchers.
Get personalized course recommendations, track subjects and courses with reminders, and more.