CS 513: Graduate Algorithms.
Instructor: S. Muthukrishnan, x2379, Core 319. muthu@cs.rutgers.edu.
Meeting:  Mondays 5--8 pm, Hill 120. Office hours: Thursdays: 11--12.
TA: Dev Desai. Office:  Office hrs: NEW: Th 3--5 PM.   Office: Hill 268.
Details: There will be suggested problems and exercises, grade will be based  on homeworks, mid term and finals.

Books: Consult all three (but use the first as the primary ref for now, many lectures will be based on my notes).

• Cormen, Leiserson, Rivest, Stein (CLRS).
• Kleinberg, Tardos.
• Dasgupta, Papadimitriou, Vazirani.

[Sorry, grades will be up by Monday, they didnt make it to the electronic system before 5 PM but are ready]


Schedule:

Date	Topic	Notes
Jan 24	Intro problems, Asymptotics
Jan 31	Recurrences, Sorting, Lower bounds, Bucket Sorting, Selection	HW1 Due Feb 7 HW1 Soln
Feb 7	Hashing, Perfect hashing, string fingerprints	HW2 Due Feb 14. HW2 Soln
Feb 14	Dynamic programming, divide and conquer	HW3 Due Feb 21 HW3 Soln
Feb 21	Graph algorithms: shortest paths, MST, DFS/BFS, connected components, topological sorting.	HW 4 Due March 7 HW4 Soln
Feb 28	MST, Global mincut and Maxflow-Mincut	HW 5 Due March 7 HW5 Soln
Mar 7	Randomized Algorithms: schwartz, ....
Mar 14		Spring Break
Mar 21	Exam	NEW: Solution
Mar 28	Dev on Approximation Algorithms
Apr 4	More Approximation Algorithms: k-center clustering.
Apr 11	Rabin's closest pairs. LP rounding based approximations for VC, Set Cover, and Count-Min Sketch for streaming algorithms.	HW6 NEW: HW6 Soln
Apr 18	Muthu at NAS Meeting: Nitish Korula lectures on primal-dual approximations.
Apr 25	Polynomial time reductions. Review of all the material.
May 2		Final Exam