Description
Principles underlying the design and analysis of efficient algorithms. Topics to be covered include: divide-and-conquer algorithms, graph algorithms, matroids and greedy algorithms, randomized algorithms, NP-completeness, approximation algorithms. Prerequisites: The mathematical maturity expected of incoming Computer Science graduate students, knowledge of algorithms at the level of COMPSCI 311. 3 credits.
General Information
Class Schedule and Reading List
Click on the syllabus link on the top of this page.
| Name | Office Hours | |
|---|---|---|
Ramesh Sitaraman | When? Where? |