A framework for boosting matching approximation: parallel, distributed, and dynamic

Abstract

This work designs a framework for boosting the approximation guarantee of maximum matching algorithms. As input, the framework receives a parameter $\hat{I}\mu >0$ and an oracle access to a $\hat{I}˜(1)$-approximate maximum matching algorithm $\mathcal{A}$. Then, by invoking $\mathcal{A}$ for $\text{poly}(1/\hat{I}\mu )$ many times, the framework outputs a $1+\hat{I}\mu$ approximation of a maximum matching. Our approach yields several improvements in terms of the number of invocations to $\mathcal{A}$: (1) In MPC and CONGEST, our framework invokes $\mathcal{A}$ for $O(1/\hat{I}{\mu }^7\cdot \log (1/\hat{I}\mu ))$ times, substantially improving on $O(1/\hat{I}{\mu }^{39})$ invocations following from [Fischer et al., STOC'22] and [Mitrovic et al., arXiv:2412.19057]. (2) In both online and offline fully dynamic settings, our framework yields an improvement in the dependence on $1/\hat{I}\mu$ from exponential [Assadi et al., SODA25 and Liu, FOCS24] to polynomial.