Near-Optimal Space and Time Cut Sparsification in Turnstile Streams
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Terminology
Sources
- Near-Linear Time Approximations for Cut Problems via Fair Cuts
- A Nearly Optimal Min-Cut Algorithm for Dynamic Streams
- Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time