Spring 2011

Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability, covering literally thousands of applications in such wide-ranging fields as chemistry and physics, computer networking, most branches of engineering, manufacturing, public policy and social systems, scheduling and routing, telecommunications, and transportation. It is classical, dating from the work of Gustav Kirchhoff, and other eminent physical scientists of the last century, and yet vibrant and current, bursting with new results and new approaches.

This class will cover algorithms for network flow and related problems. We will cover both classical results and modern state-of-the-art algorithms for a number of network flow problems including the shortest paths, maximum flow, minimum cut, minimum cost flow, matching and multicommodity flow problems. The focus will be on learning about a number of different algorithmic techniques that have proved fruitful in this, and other areas. We will also discuss applications and related problems.

- Errata for the textbook
- Basics of Algorithm Analysis
- Running times of various functions
- Basic Graph Search
- Minimum Spanning Trees
- Paper describing linear-time minimum spanning tree algorithm
- Shortest Paths
- All Pairs Shortest Paths
- Slides from a talk on implementing shortest path algorithms
- Maximum Flows
- Minimum Cost Flow via Capacity Scaling
- Multicommodity Flow paper
- Max Flow paper
- Min Cut paper

- Thursday 3/3. No class
- Tuesday 3/8. Midterm 2:40-5:30. Horace Mann 146 (Teachers College).
- Thursday 3/10. No class.
- Tuesday 3/15. No class. Spring break.
- Thursday 3/17. No class. Spring break.
- Tuesday 3/22. Class 2:40 - 5:30. The part from 4:10-5:25 will be in 324 Millbank.
- Final: Handed out May 4, 9AM, Due May 6, 4PM.