Schedule

Day Time Class Room
Tuesday
3:30-4:55
A1
Friday
2:00-3:25
A1

Prerequisites

  • Algorithm design techniques - Greedy and Dynamic Programming.
  • NP-Completeness theory.
  • Randomized algorithms.
  • Discrete Probability
  • Linear Algebra/Programming

Books

Approximation Algorithms for NP-Hard problems edited by Dorit Hochbaum.
Approximation Algorithms by Vijav V Vazirani

Newsgroup/Mailing list

A mailing list cs630[at]cse and a newsgroup iitb.courses.cs630 have been set up. Students crediting/auditing the course are encouraged to subscribe to these. Please use the newsgroup for discussions. The mailing list will be used (mostly by instructor/TAs) for announcements.

Last modified on 5 Jan 2006 4:01am.