Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.34097

A Nearly Optimal Min-Cut Algorithm for Dynamic Streams

Yang P. Liu·Hoai-An Nguyen·Vihan Shah·David P. Woodruff
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give an $\tilde{O}(n/\varepsilon)$-space algorithm for the minimum cut problem in dynamic streams, resolving the space complexity of streaming min-cut up to polylogarithmic factors. Ding, Garces, Li, Lin, Nelson, Shah, and Woodruff (ITCS 2025) obtained the same $\tilde{O}(n/\varepsilon)$ space bound for insertion-only streams, while prior to our work the best known bound even for unweighted dynamic streams was $\tilde{O}(n/\varepsilon^2)$, due to Ahn, Guha, and McGregor (PODS 2012). Our main technical contribution is an $\tilde{O}(n/\varepsilon)$-space for-each cut sketch in dynamic streams, which may be of independent interest. The construction applies to weighted graphs under general $\pmΔ$ updates, a stronger model than the standard dynamic-stream setting in which weighted edges are inserted and deleted in their entirety. Despite this stronger guarantee, our algorithm is surprisingly simple and relies on very little machinery. We also obtain applications to minimum $\ell_p$-norm $k$-partitioning for every fixed $k$, weighted correlation-clustering evaluation for two clusters, and for-each cut sketching in balanced directed graphs.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang P. Liu, Hoai-An Nguyen, Vihan Shah, David P. Woodruff. 2026-10-25. A Nearly Optimal Min-Cut Algorithm for Dynamic Streams. https://arxiv.org/abs/2610.34097

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Online Multi-Level Aggregation with Maximum Delay

We study Multi-Level Aggregation with Maximum Delay (MLA-MD) on finite weighted rooted trees. Each service pays for a rooted subtree and for the maximum waiting time among the requests it clears. For the offline problem, we give an exact polynomial-time algorithm that computes both the optimum and an optimal service schedule. For the online problem, we give a deterministic $2$-competitive algorithm and, against an oblivious adversary, a randomized $e/(e-1)$-competitive algorithm. Both competitive ratios are optimal, even on rooted paths. We also extend the offline result and both online guarantees to service systems with submodular costs.

cs.DS↗
arXiv2026

Exact algorithms for optimal discretization

The optimal discretization problem asks, given two disjoint sets of points $R$ and $B$ in the plane, for a minimal family of horizontal and vertical lines that separate the two sets, so that no cell delimited by the lines contains points from both sets. The problem arises as a pre-processing in supervised machine learning, and has received significant attention in parameterized algorithmics. Answering the question raised by Bonnet, Giannopoulos, and Lampis [IPEC 2017] and Froese [PhD thesis, 2018], it was shown by Kratsch, Masařík, Muzi, Pilipczuk, and Sorge [SODA 2021] that optimal discretization admits a fixed-parameter algorithm with running time $2^{\mathcal{O}(k^2 \log k)} \cdot n^{\mathcal{O}(1)}$, where $k$ is the solution size and $n = |R| + |B|$. In this paper we give an algorithm for optimal discretization that runs in time $\mathcal{O}(1.9602^n)$. We also study the related point separation problem that asks to separate all input points by axis-parallel lines. For this problem we obtain an algorithm with runtime $\mathcal{O}(1.8899^n)$. Our guarantees follow from structural observations about bichromatic and monochromatic point sets. To our knowledge, these are the first improvements over the trivial $2^n$ bound for both problems.

cs.DS↗