Dynamic matching with better-than-2 approximation in polylogarithmic update time

DOI10.1145/3679009MaRDI QIDQ6993545zbMATH OpenFDO

Authors Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc

Publication date 25 April 2025

Published in Journal of the ACM (Search for Journal in Brave)

zbMATH Keywords

approximate matchingdynamic algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Dynamic matching with better-than-2 approximation in polylogarithmic update time

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