Presentation Schedule

---

	Date	Topic	Presenter
1.	1 Sep	Introduction to complexity and approximation	Mohit Tawarmalani
2.	8 Sep	Approximation algorithms for the Set Cover problem	Anastasia Vaia
3.	15 Sep	Randomized Rounding: A technique for provably good algorithms and algorithmic proofs	Mayank Mishra
4.	22 Sep	Inapproximability theorems	Bardia Sadri
5.	29 Sep	Asymptotically exact polynomial algorithms in integer linear programming	Sumit Mehra
6.	6 Oct	Randomisation: MAX SAT	Hemanshu Kaul
7.	13 Oct	Approximation algorithms for graph coloring and MAX CUT	Ravi Prakash
8.	27 Oct	Approximation algorithms for the bin-packing problem	Gautam Nanda
9.	3 Nov	Primal-Dual Approximation Algorithm for Uncapacitated Fixed-Charge Network Design	Kevin Furman
10.	1 Dec	Heuristics and Approximation Schemes for QoS Routing and Performance Studies	K. Thulasiraman
11.	8 Dec	Approximation algorithms for Uncapacitated Facility Location	Baris Yalabik

---

 Back to course page