Lecture: | Monday, Wednesday, and Friday 2:30-4 in 32-144. | |||
Units: | 5-0-7 Graduate H-level | |||
Professor: | David Karger | karger at mit edu | Office hours: By appt. in Building 32, Room G592 | |
TA: | Katherine Lai | k_lai at mit edu | Office hours: Mondays, 4:30-6:30pm in lounge next to "Theory Lab" (32G-575), or by appointment | |
Course assistant: | Be Blackburn | be at theory csail mit edu | Office: Building 32, Room G692 | |
The prerequisites for this class are undergraduate courses in algorithms (e.g., 6.046) and discrete mathematics and probability (e.g., 6.042), in addition to mathematical maturity.
The coursework will involve problem sets and a final project that is research-oriented. For more details, see the handout on course information.
Problem Set | Due Date | Solutions | Graders/Other notes |
---|---|---|---|
1 | Wed, Sep. 12 | 1 | Nada Amin, Hyun Soo Kim, Anthony Kim, Debmalya Panigrahi |
2 | Wed, Sep. 19 | 2 | Matt Faulkner, Polychronis Ypodimatopoulos, Issao Fujiwara |
3 | Wed, Sep. 26 | 3 | Evan Jones, Zuoyu Tao, Yuetian Xu |
4 | Wed, Oct. 3 | 4 | Yaodong Zhang, Jing Chen, Dahua Lin |
5 | Wed, Oct. 10 | 5 | Albert Ni, Radu Berinde |
6 | Wed, Oct. 17 | 6 | Wonsik Kim, Michael Forbes |
7 | Wed, Oct. 24 | 7 | Thomas Belulovich, Oleg Golberg |
8 | Wed, Oct. 31 | 8 | Nadia Benbernou, Ankur Moitra |
9 | Wed, Nov. 7 | 9 | Kuat Yessenov, Zachary Remscrim |
10 | Wed, Nov. 14 | 10 | Thomas Mildorf, Alvin Cheung |
11 | Wed, Nov. 21 | 11 | Po-Ru Loh, Greg Price |
12 | This will be an optional problem set. |
1. | Wed, Sep. 5: | Course introduction. Fibonacci heaps. MST.(scribe notes, latex source) (raw notes on intro, Fibonacci heaps). |
2. | Fri, Sep. 7: | Persistent data structures (notes, sources) (raw notes on persistent data structures). |
3. | Mon, Sep. 10: | Splay trees (old scribe notes, old latex sources, raw notes ). |
4. | Wed, Sep. 12: | Hashing. (old scribe notes, old latex sources) (raw notes on hashing). |
Fri, Sep. 14: | Rosh Hashana, no class | |
5. | Mon, Sep. 17: | Perfect Hashing. Dijkstra's Algorithm. Dial's Algorithm. Tries. (Erik's lecture notes) |
6. | Wed, Sep. 19: | van Emde Boas queues. (old
scribe notes, old
latex sources) (raw notes on multi-level
buckets, and vEB queues). Network Flows (scribe notes, latex sources, raw notes on flow). (Erik's lecture notes) |
7. | Fri, Sep. 21: | Network Flows: Augmenting Paths, Maximum Augmenting Paths, Scaling. (see notes from previous lecture) |
Mon, Sep. 24: | student holiday, no class | |
8. | Wed, Sep. 26: | Reductions between Flow Problems.
Bipartite Matching.
Shortest Augmenting Path.
Blocking Flows (scribe notes, latex sources) and (scribe notes, latex sources). |
Fri, Sep. 28: | Optional Lecture: Link cut trees (raw notes) | |
9. | Mon, Oct. 1: | Min-Cost Flows. Definitions. Algorithms. feasible prices. complementary slackness. (scribe notes, sources, raw notes on min-cost flow). |
10. | Wed, Oct. 3: | Min-Cost Flows: shortest augmenting path; pseudopolynomial
solution. (scribe notes, sources). |
Fri, Oct. 5: | Optional lecture: Push Relabel Algorithm | |
Mon, Oct. 8: | Columbus day, no class | |
11. | Wed, Oct. 10: | Linear-programming: definitions: canonical and standard forms, feasibility and optimization. Structure of Optima. (scribe notes, sources, raw notes on linear programming). |
12. | Fri, Oct. 12: | Linear-Programming: Duality. (scribe notes, sources) |
13. | Mon, Oct. 15 | Linear-Programming: Complementary slackness. LP algorithms |
14. | Wed, Oct. 17 | Linear-Programming algorithms: Simplex, Ellipsoid. (old scribe notes with sources) (scribe notes, latex sources).. |
15. | Fri, Oct. 19: | Linear-Programming Algorithms: Interior Point. NP-hard problems. Approximation Algorithms. (scribe notes, latex sources). |
16. | Mon, Oct. 22: | Relative Approximations. PAS and FPAS. Scheduling. |
17. | Wed, Oct. 24 | Enumeration. Relaxations. 3/2-approximation for TSP. (notes, sources). |
18. | Fri, Oct. 26: | ILP relaxations. Randomized Rounding. (scribe notes, sources) |
19. | Mon, Oct. 29: | Fixed-parameter tractability. (scribe notes, sources) Treewidth. (notes, sources) |
20. | Wed, Oct. 31: | Online algorithms: ski rental, stock market, load balancing. (notes, sources) |
Fri, Nov. 2: | [Optional]: PTAS for Geometric TSP | |
21. | Mon, Nov. 5 | Online algorithms: paging. (notes, sources) |
22. | Wed, Nov. 7 | Randomized online algorithms, adversaries. k-server. (notes, sources) |
23. | Fri, Nov. 9 | Computational geometry: orthogonal range search, sweep algorithms (segment intersections) (notes, sources) |
Mon, Nov. 12 | Veteran's day, no class | |
24. | Wed, Nov. 14 | Computational geometry: convex hull (notes, sources) |
25. | Fri, Nov. 16 | Computational geometry: Voronoi diagrams (notes) |
26. | Mon, Nov. 19 | External memory algorithms. (raw notes) |
27. | Wed, Nov. 21 | Cache oblivious algorithms |
Fri, Nov. 23 | Thanksgiving vacation; no class | |
Mon, Nov. 26 | Parallel algorithms: circuits and PRAMs. (raw notes on parallel algorithms) | |
Wed, Nov. 28 | Online algorithms: k-server on a line. Finance. Yao's minimax principle. (notes, sources) | |
Mon, Dec. 3 | ||
Wed, Dec. 5 | ||
Mon, Dec. 10 | Tries. Suffix trees (old scribe notes, old latex sources, raw notes). | |
Wed, Dec. 12 | Last day of classes |
The Stellar website now includes some of the inaccessible papers.