Approximate max-flow min-cut theorem
= Approximate max-flow min-cut theorem
{wiki=Approximate_max-flow_min-cut_theorem}
The Approximate Max-Flow Min-Cut Theorem is a concept in network flow theory, particularly relevant in the context of optimization problems involving flow networks. The theorem relates to the maximum flow that can be sent from a source node to a sink node in a directed graph, and the minimum cut that separates the source from the sink in that graph.