A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching

We present a simple semi-streaming algorithm for $(1-ε)$-approximation of bipartite matching in $O(\log{\!(n)}/ε)$ passes. This matches the performance of state-of-the-art "$ε$-efficient" algorithms -- the ones with much better dependence on $ε$ albeit with some mild dependence on $n$ -- w...

Full description

Saved in:
Bibliographic Details
Published in:TheoretiCS Vol. 4
Main Author: Assadi, Sepehr
Format: Journal Article
Language:English
Published: 01.08.2025
ISSN:2751-4838, 2751-4838
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first