Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time
From MaRDI portal
Publication:5146943
DOI10.1137/1.9781611975994.152OpenAlexW2990730306MaRDI QIDQ5146943
Soheil Behnezhad, Jakub Łącki, Vahab S. Mirrokni
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/1911.01839
Related Items
Deterministic dynamic matching in worst-case update time ⋮ Unnamed Item ⋮ Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
This page was built for publication: Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time