Approximation Algorithm

ABOUT THE COURSE: Many real-world problems are NP-complete. Hence, they are unlikely to admit a polynomial-time algorithm. In this course, we will study various techniques to design efficient algorithms to compute an approximately optimal solutions. INTENDED AUDIENCE: Under-graduate and post-graduate students and faculty members. PREREQUISITES: Knowledge of algorithm design principles. INDUSTRY SUPPORT: All software companies especially Google, Microsoft, etc.