In this course, I will introduce several efficient combinatorial algorithms 
for network flow and routing problems. This includes algorithms for maximum 
cardinality matching problem, minimum-cost matching problem, transportation 
problem, transshipment problem, minimum-cost flow problem and the traveling 
salesman problem. 

In addition to these algorithms, I will introduce some recent techniques to 
make asymptotic improvements to these algorithms under certain settings. 
I will also show how these algorithms can be adapted to design algorithms in  
the online and streaming models. 

Students in this class will be evaluated on class participation, an in-class 
presentation that may span one or two lectures and a class project.