Instructor: | David P. Williamson |
---|---|

Office: | Rhodes 236 |

Office hours: | M 1:30-2:30, W 11-12, and by appointment |

Office phone: | 255-4883 |

Email: | My three initials AT cs.cornell.edu |

The course meets Tuesdays and Thursdays in Olin 216 Upson 109 from 11:40 to 12:55.

This course will introduce students to the basic problems in network flow theory, and polynomial-time algorithms for solving them. The focus will be on the analysis of these polynomial-time algorithms, and some common themes in approaching network flow problems; that being said, flow problems are amenable to a surprising variety of approaches, and we will look at several of them. The bulk of the course will cover finding maximum flows, minimum global cuts, minimum-cost circulations, maximum generalized flows, maximum multicommodity flows, and flows over time. As time permits, we will also cover more advanced topics, including applications of flows to problems in economics, game theory, and coding theory, submodular function minimization, and uses of randomization in flow algorithms.

Lecture Notes on Network Flow (Spring 2004)

ZIP file with sample scribe notes