Prerequisites

Theory: Data Structure, Algorithms, FLAT, Probabilities, Continuous Optimization.



Books

The Majority of the course content follows from the first two references.

1. VV - Vijay Vazirani. Approximation Algorithms

2. WS - Williamson Shmoys The Design of Approximation Algorithms Cambridge University Press (2011)



Tentative Schedule

Week Topic Reading Additional and Assignments
1 Introduction, Mathematical Preliminaries VV, WS
2 Steiner Tree, Metric TSP, K-Center, Set Cover VV,WS
3 Randomized Rounding VV,WS
4 Binpacking Knapsack VV,WS
5 Primal Dual
6 SDP


TAs - Office Hour

TA: Zafeer, Ayush, Srinath ({223CS3141, 223CS3159, 223CS3363}@nitrkl.ac.in)

Office Hour: Wednesday 11AM-12AM.