There is no specific prerequisite for this course, but some previous exposure to the design and analysis of algorithms will be assumed.
Approximation algorithms for a single-machine scheduling problem.
We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of k. For maximum concurrent flow, and minimum cost concurrent flow, we present algorithms that are faster than the current known algorithms when the graph is sparse or the number of commodities k is large, i.e. Joseph S.B. Mitchell April 8.