Maximum Flow and Minimum Cut Max flow and min cut. Two very rich algorithmic problems. Cornerstone problems in combinatorial optimization. Beautiful mathematical duality. Nontrivial applications reductions. Data mining. Network reliability. Open-pit mining. Distributed computing. Project selection. Egalitarian stable matching. Airline scheduling. Security of statistical data. Bipartite matching. Network intrusion detection. Baseball elimination. Multi-camera scene ·Image segmentation. reconstruction. Network connectivity. Many many more .. 33 Maximum Flow and Minimum Cut Max flow and min cut.  Two very rich algorithmic problems.  Cornerstone problems in combinatorial optimization.  Beautiful mathematical duality. Nontrivial applications / reductions.  Data mining.  Open-pit mining.  Project selection.  Airline scheduling.  Bipartite matching.  Baseball elimination.  Image segmentation.  Network connectivity.  Network reliability.  Distributed computing.  Egalitarian stable matching.  Security of statistical data.  Network intrusion detection.  Multi-camera scene reconstruction.  Many many more …