|
CSE 521, Wi '13: Approximate Schedule |
|
 CSE Home |
About Us |
Search |
Contact Info |
Schedule details will evolve as we go; check back periodically to see the latest updates.
| Due | Lecture Topic | Reading | ||
|---|---|---|---|---|
| Week 1 1/7-1/11 |
Tu | Intro, Examples & Complexity | Ch. 1; Ch. 2 | |
| Th | Graph Algorithms | Ch. 3 | ||
| Week 2 1/14-1/18 |
Tu | |||
| Th | Greedy Algorithms | Ch. 4 (optional: 4.9). (4.4-4.6 is review; skim/read as needed.) | ||
| Week 3 1/21-1/25 |
Tu | |||
| Th | HW #1 | Divide & Conquer | Ch. 5 | |
| Week 4 1/28-2/1 |
Tu | |||
| Th | HW #2 | |||
| Week 5 2/4-2/8 |
Tu | Dynamic Programming | Ch. 6. (Section 6.8 should be review; 6.7 and 6.9-6.10 are optional.) | |
| Th | HW #3 | |||
| Week 6 2/11-2/15 |
Tu | |||
| Th | HW #4 | Network Flow | Ch. 7.1-7.7, 7.12; (7.8-7.11, 7.13 optional, but I recommend reading one or two of them) | |
| Week 7 2/18-2/22 |
Tu | |||
| Th | HW #5 | NP-Completeness & Intractability | Ch. 8(all). Optional: Material covered in lecture on the polynomial hierarchy, games and PSPACE is touched on in KT 9.1-9.3, 9.5, if you want something more than my slides. Also consider taking CSE 531. |
|
| Week 8 2/25-3/1 |
Tu | |||
| Th | HW #6 | |||
| Week 9 3/4-3/8 |
Tu | |||
| Th | HW #7 | Linear Programming | Read KT section 11.6 and Dasgupta, Papadimitriou, and Vazirani, Chapter
7: Read 7.1, 7.4, 7.6, 7.7. Skim sections 7.2 and 7.3 for connections to LP. Optional: 7.5. |
|
| Week 10 3/11-3/15 |
Tu | |||
| Th | HW #8 | LP Wrap up & Final Review |
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX |