Combinatorial Optimization

1 Unit · Graduate

Efficient methods and min-max results for combinatorial optimization problems including minimum spanning trees, shortest paths, maximum flows, minimum cost flows, matching; polyhedral combinatorics; complexity theory.