EECS 586, Winter 2006
Upcoming discussion topics
Final Homework assignment
Due: Tuesday, April 18, 2006
- Following discussion of NP-hardness of minesweeper, we'll go
through most of CLRS 35.
- Section 35.4 uses linear programming. You may want to review
29.1 and 29.2 for this, though we will not get into the details
- Previous discussion topics.
Please look these over as soon as possible and let me know about any
issues (including possible suspected mismatch between the problem
number and English title).
- 11-2 (slot-size for chaining)
- 23-1 (second-best MST)
- 24-3 (arbitrage)
- 35-4 (maximum matching)
Old homework announcements here.
Course Goals and Policies
Goals, policies, and syllabus document available here. (Revised January 5.)
|Title ||EECS 586, Design and Analysis of Algorithms
|Instructor ||Assistant Professor Martin Strauss|
| Office, central campus || 3063 East Hall|
| Office, north campus ||3611 CSE|
|Email || martinjs .at. umich.edu |
|Office hours || After class and by appointment.|