Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,143,942 papers from all fields of science
Search
Sign In
Create Free Account
Approximate max-flow min-cut theorem
Approximate max-flow min-cut theorems are mathematical propositions in network flow theory. They deal with the relationship between maximum flow rate…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Approximation algorithm
Flow network
Ford–Fulkerson algorithm
Graph partition
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
1993
1993
Bounds on the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
P. Klein
,
Serge A. Plotkin
,
Satish Rao
,
É. Tardos
1993
Corpus ID: 686050
The best-known theorem in combinatorial optimization is the classical max-flow min-cut theorem of Ford and Fulkerson. This…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE