Approximate Maximum Matching in Random Streams

DOI10.1137/1.9781611975994.108OpenAlexW3002823730MaRDI QIDQ5146889

No author found.

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/1912.10497

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Markovian online matching algorithms on large bipartite random graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal lower bounds for matching and vertex cover in dynamic graph streams

This page was built for publication: Approximate Maximum Matching in Random Streams