ARCHIVE PAGE

Instructor: Gábor Hetyei

Important information:

• Course syllabus
• Homework

Our final exam is on Wednesday, Dec 11, 11:00-1:30 pm in Fretwell 306. You may downloaed the Sample Final Exam questions to prepare for it.

Handouts:

• Sample Test 1
• Sample Test 2
• Sample Final Exam questions (Subject to changes until Monday December 2)
• Kruskal's and Prim's algorithm
• "Complete failure" of the Ford-Fulkerson algorithm
• Network flows
• Birkhoff's Theorem
• A remarkable example of the transportation problem from Section 4.5 in Tucker's Applied Combinatorics, 5th Ed. (optional material)
• The dual to the transportation problem
• The approximate traveling salesperson tour algorithm (optional material)