Distributed local approximation algorithms for maximum matching in graphs and hypergraphs

DOI10.1109/FOCS.2019.00048MaRDI QIDQ6944189zbMATH OpenFDO

Authors David G. Harris

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2019.00048

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• Local distributed rounding: generalized to MIS, matching, set cover, and beyond
• Fast algorithms for Vizing's theorem on bounded degree graphs
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
• Locally computing edge orientations
• Faster edge coloring by partition sieving
• Local density and its distributed approximation

This page was built for publication: Distributed local approximation algorithms for maximum matching in graphs and hypergraphs

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