The paper constructs a for-each spectral sparsifier in O-tilde(n/ε) streaming space, breaking the Ω(n/ε^2) for-all sparsifier barrier, and uses it for near-optimal minimum cut and effective resistance algorithms.
Beating Two-Thirds For Random-Order Streaming Matching
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
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Space Complexity of Minimum Cut Problems in Single-Pass Streams
The paper constructs a for-each spectral sparsifier in O-tilde(n/ε) streaming space, breaking the Ω(n/ε^2) for-all sparsifier barrier, and uses it for near-optimal minimum cut and effective resistance algorithms.