Media Summary: Five essential tools for the analysis of randomized Introduction to linear programming. Geometric intuition. Applications: maximum and minimum-cost flow; linear regression; ... Maximum flow: the push-relabel approach. Full
A Second Course In Algorithms - Detailed Analysis & Overview
Five essential tools for the analysis of randomized Introduction to linear programming. Geometric intuition. Applications: maximum and minimum-cost flow; linear regression; ... Maximum flow: the push-relabel approach. Full Online decision-making. Regret. The multiplicative weights The minimum s-t cut problem. Application to image segmentation. Reducing bipartite matching to maximum flow. Hall's theorem. Minimum-cost bipartite matching. Optimality conditions. The Hungarian (Kuhn-Munkres/Jacobi)
Proof of the max-flow/min-cut theorem. Augmenting on shortest paths (Edmonds-Karp). The blocking flow approach (Dinic). Beating brute-force search for NP-hard problems. Fixed-parameter tractability: vertex cover revisited. Exact TSP via dynamic ...
