Incremental (1-)-approximate dynamic matching in O(poly((1/)) update time

DOI10.4230/LIPICS.ESA.2023.22MaRDI QIDQ6656964zbMATH OpenFDO

Authors Joakim Blikstad, Peter Kiss

Publication date 6 January 2025

zbMATH Keywords

approximation algorithmsbipartite matchingdynamic algorithmsincremental matchingEDCS

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Incremental \((1-\varepsilon)\)-approximate dynamic matching in \(O(\text{poly}((1/\varepsilon))\) update time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656964)