arXiv:2610.36577 · v1

An Unconditional Space-Approximation Lower Bound for Semi-Streaming Matching

首次提交 2026-10-27 11:32

版本更新 2026-10-27 11:32

雷达观测 2026-10-29 00:35

摘要

We prove the first unconditional lower bound tradeoff between the number of passes and the approximation factor of maximum matchings in the semi-streaming model. Specifically, we show that any algorithm that outputs an $(1-\varepsilon)$-approximation to maximum matching requires $Ω(\log(1/\varepsilon))$ passes for constant $\varepsilon \in (0,1)$. Prior to our result, such tradeoffs were proven only conditioned on a certain combinatorial assumption about the density of Ruzsa-Szemerédi graphs. The state-of-the-art unconditional lower bound rules out any approximation factor better than $(8/9)$ in two passes but leaves open the possibility of a $(1-\varepsilon)$-approximation for any $\varepsilon > 0$ even in three passes. We provide two different proofs of our result: the first proof uses the recent hierarchical-embedding framework of Assadi, Konrad, Naidu, and Sundaresan (STOC 2024) along with combinatorial constructions using Ruzsa-Szemerédi graphs. The second extends the two-level Ruzsa-Szemerédi hierarchy of Konrad and Naidu (SODA 2024) beyond two levels and proves the corresponding communication lower bound directly by induction, rather than through a reduction to Index.