Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

DOI10.1137/1.9781611975994.107OpenAlexW3001104546MaRDI QIDQ5146888

Jakab Tardos, Ashkan Norouzi-Fard, Michael Kapralov, Slobodan Mitrović

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.05725

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ An estimator for matching size in low arboricity graphs with two applications

This page was built for publication: Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples