Towards a Unified Theory of Sparsification for Matching Problems
SOSA@SODA, Volume abs/1811.02009, 2019.
In this paper, we present a construction of a `matching sparsifieru0027, that is, a sparse subgraph of the given graph that preserves large matchings approximately and is robust to modifications of the graph. We use this matching sparsifier to obtain several new algorithmic results for the maximum matching problem: * An almost $(3/2)$-app...More
Full Text (Upload PDF)
PPT (Upload PPT)