Advanced Algorithms by Prof. Michel Goemans

This note
is designed for doctoral students interested in theoretical computer science.
Topics covered includes: Fibonacci heaps, Network flows, Maximum flow, minimum
cost circulation, Goldberg-Tarjan min-cost circulation algorithm,
Cancel-and-tighten algorithm; binary search trees, Splay trees, Dynamic trees ,
Linear programming, LP: duality, geometry, simplex, LP: complexity, ellipsoid
algorithm, LP: applications of the ellipsoid algorithm, Conic programming,
Approximation algorithms, Max-cut and sparsest-cut, Multi-commodity flows and
metric embeddings, Convex hulls.

**Author(s):** Prof. Michel Goemans

NA Pages