The directed flow-cut gap is at most n^{1/3 + o(1)}.
Cuts, trees andℓ 1-embeddings of graphs.Combinatorica, 24(2):233–269
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
unclear 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)}.