A Õ(n^{1.5} log(W/ε))-space, Õ(√n log(W/ε))-pass streaming algorithm returns approximate min-cost flows on-the-fly, circumventing Ω(n²) space lower bounds.
A simple semi-streaming algorithm for global minimum cuts
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
background 1representative citing papers
citing papers explorer
-
Computing Flows in Subquadratic Space
A Õ(n^{1.5} log(W/ε))-space, Õ(√n log(W/ε))-pass streaming algorithm returns approximate min-cost flows on-the-fly, circumventing Ω(n²) space lower bounds.