The directed flow-cut gap is at most n^{1/3 + o(1)}.
Approximate max-flow min-(multi) cut theo- rems and their applications.SIAM Journal on Computing, 25(2):235–251
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Improved Upper Bounds for the Directed Flow-Cut Gap
The directed flow-cut gap is at most n^{1/3 + o(1)}.