Announcements
- (Mar 13) The in-class final will be on Monday March 19, 3:30-6:30 PM, in Shriram 104
- (Mar 13) Exercises for week 8 (Mar 5 & 7) have been posted
- (Mar 3) Homework 4 has been posted
Course Description
Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to online algorithms.