Approximating maximum weight matching in near-linear time

DOI10.1109/FOCS.2010.70MaRDI QIDQ6990281zbMATH OpenFDO

Authors Seth Pettie, Ran Duan

Publication date 29 April 2025

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

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• Near optimal algorithm for fault tolerant distance oracle and single source replacement path problem

This page was built for publication: Approximating maximum weight matching in near-linear time

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