Improved Weighted Matching in the Sliding Window Model
Abstract
We consider the Maximumweight Matching (MWM) problem in the streaming sliding window model of computation.
In this model, the input consists of a sequence of weighted edges on a given vertex set $V$ of size $n$.
The objective is to maintain an approximation of a maximumweight matching in the graph spanned by the $L$ most recent edges, for some integer $L$, using as little space as possible.
Prior to our work, the stateoftheart results were a $(3.5+\varepsilon)$approximation algorithm for MWM by Biabani et al. [ISAAC’21] and a $(3+\varepsilon)$approximation for (unweighted) Maximum Matching (MM) by Crouch et al. [ESA’13]. Both algorithms use space $\tilde{O}(n)$.
We give the following results:

We give a $(2+\varepsilon)$approximation algorithm for MWM with space $\tilde{O}(\sqrt{nL})$. Under the reasonable assumption that the graphs spanned by the edges in each sliding window are simple, our algorithm uses space $\tilde{O}(n \sqrt{n})$.

In the $\tilde{O}(n)$ space regime, we give a $(3+\varepsilon)$approximation algorithm for MWM, thereby closing the gap between MWM and MM.
Similar to Biabani et al.’s MWM algorithm, both our algorithms execute multiple instances of the $(2+\varepsilon)$approximation $\tilde{O}(n)$space streaming algorithm for MWM by Paz and Schwartzman [SODA’17] on different portions of the stream. Our improvements are obtained by selecting these substreams differently. Furthermore, our $(2+\varepsilon)$approximation algorithm runs the PazSchwartzman algorithm in reverse direction over some parts of the stream, and in forward direction over other parts, which allows for an improved approximation guarantee at the cost of increased space requirements.
2024 © Kheeran K. Naidu