lower bounds 2maximum matching 2semi-streaming algorithms 2blueprint framework 1graph streaming 1greedy algorithm 1online matching 1
From the 2 of 2 linked papers with an AI index.
2 papers
cs.DS2026
Semi-Streaming Matching in a Single Pass II: Greedy is Optimal
Sepehr Assadi, Max Jiang, Mars Xiang
The paper proves that no single-pass semi‑streaming algorithm can achieve better than a 1/2 approximation for maximum matching, establishing the greedy algorithm as optimal and als…
cs.DS2026
Semi-Streaming Matching in a Single Pass I: A New Framework for Lower Bounds via Blueprints
Sepehr Assadi, Max Jiang, Mars Xiang
The paper presents a new blueprint-based framework for proving lower bounds on the approximation ratio of single‑pass semi‑streaming algorithms for maximum matching, simplifying pr…