Reproduce “Faster Semi-Streaming and Dynamic Approximate Maximum Weight Matchings in General Graphs: A Unified Framework” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Jiale Chen
The authors present a framework for approximate matching in general graphs, regularizing vertex duals while preserving odd-set feasibility through a cut partition. Each optimization step combines an accurate solve on a sparse subgraph with a constant-accuracy solve on crossing edges. The deterministic semi-streaming algorithm uses O(epsilon^-2) passes for maximum-cardinality matching and O(epsilon^-2 log(1/epsilon)) for maximum-weight matching, with polynomially bounded edge weights.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.