[2607.14656] Semi-Streaming Matching in a Single Pass II: Greedy is Optimal

Skip to main content

Search arXiv

Press Enter to search · Advanced search

-->

Computer Science > Data Structures and Algorithms

arXiv:2607.14656 (cs)

[Submitted on 16 Jul 2026 (v1), last revised 20 Jul 2026 (this version, v2)]

Title:Semi-Streaming Matching in a Single Pass II: Greedy is Optimal

Authors:Sepehr Assadi, Max Jiang, Mars Xiang<br>View a PDF of the paper titled Semi-Streaming Matching in a Single Pass II: Greedy is Optimal, by Sepehr Assadi and 2 other authors

View PDF<br>HTML (experimental)

Abstract:We prove that no single-pass semi-streaming algorithm (deterministic or randomized) can achieve a better-than-half approximation to the maximum matching problem. This implies the optimality of the naive greedy algorithm, answering an outstanding open question in the graph streaming literature since the introduction of the model over two decades ago.

Our proof follows the "blueprint framework" introduced previously by the authors, which reduced proving lower bounds for semi-streaming matching to constructing certain combinatorial objects called blueprints. We present an optimal construction of blueprints that when used in this framework implies our semi-streaming matching lower bound.

Our results also imply that the optimal competitive ratio of online matching with preemption is half, again matching the naive greedy algorithm, settling this open question as well.

Comments:<br>23 pages, 3 figures. Version 2: Fixed typos and minor language issues throughout

Subjects:

Data Structures and Algorithms (cs.DS); Computational Complexity (cs.CC)

Cite as:<br>arXiv:2607.14656 [cs.DS]

(or<br>arXiv:2607.14656v2 [cs.DS] for this version)

https://doi.org/10.48550/arXiv.2607.14656

Focus to learn more

arXiv-issued DOI via DataCite

Submission history<br>From: Sepehr Assadi [view email]<br>[v1]<br>Thu, 16 Jul 2026 07:22:45 UTC (39 KB)

[v2]<br>Mon, 20 Jul 2026 02:47:00 UTC (39 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled Semi-Streaming Matching in a Single Pass II: Greedy is Optimal, by Sepehr Assadi and 2 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.DS

next >

new<br>recent<br>| 2026-07

Change to browse by:

cs<br>cs.CC

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

Major funding support from