The seminar will be about a few classical combinatorial optimization algorithms. The problems we will talk about are shortest paths, maximum flow, minimum cost flow, and maximum matching. Please read the guidelines in the attached file.
Guidlines and bibliography