3 PM - 4:15 PM, Tue/Thu, FNY B124
Jeremiah Blocki, [jblocki AT purdue]
Office Hours: W/F 11AM to noon
Akash Kumar: [akash DOT mnnit AT gmail]
Office Hours: Mondays from 10 AM to 12 noon @ LWSN 3133
Hamidreza Amini Khorasgani: [haminikh AT purdue]
Office Hours: Tuesday/Thursday from 1-2PM @ HAAS G50
Welcome to CS 580!
Please sign-up on Piazza to ask/answer questions. We will send class announcements through this site.
- Required: Algorithm Design
J. Kleinberg, E. Tardos. Pearson Education.
Book slides by Kevin Wayne
- Recommended: Introduction to Algorithms
T. Cormen, C.Leiserson, R. Rivest, C. Stein. MIT
- Check here for pointers on LaTeX.
A tentative list of topics includes scheduling problems, minimum spanning tree problems, data compression, network flow,
NP and computational intractability, approximation algorithms, randomized algorithms, sublinear algorithms.
Mathematical maturity. Undergraduate algorithms (CS 381).
- 20% for homework
- 20% for the midterm 1
- 20% for the midterm 2
- 35% for the final
- 5% for class participation.