Constant-factor approximation to maximum matching size requires nearly linear samples in m but only O(log^2 n) space using recursive peeling simulation, improving prior polylog approximation.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Constant-factor approximation to maximum matching size requires nearly linear samples in m but only O(log^2 n) space using recursive peeling simulation, improving prior polylog approximation.