Lectures
10:30 AM - 11:45 AM, Tue/Thu, WANG 2599
Instructor
Jeremiah Blocki, j...@purdue.edu
Office Hours: Wed/Fri 11am-noon @ LWSN 1165.
TAs:
Akash Kumar: a...@purdue.edu
Office Hours: Tuesday, 1PM @ LWSN 3133
Chang Li: l...@purdue.edu
Office Hours: Monday, 11AM-1PM @ Haas G50
Announcements
Welcome to CS 580!
Please sign-up on Piazza to ask/answer questions. We will send class announcements through this site.
Texts
- 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
LaTeX resources
- Check here for pointers on LaTeX.
Course description
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.
Prerequisites:
Mathematical maturity. Undergraduate algorithms (CS 381).
Grading
- 20% for homework
- 20% for the midterm 1
- 20% for the midterm 2
- 35% for the final
- 5% for class participation.