Scalable auction algorithms for bipartite maximum matching problems

DOI10.4230/LIPICS.APPROX/RANDOM.2023.28MaRDI QIDQ6663043zbMATH OpenFDO

Authors Quanquan C. Liu, Yiduo Ke, Samir Khuller

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.28

zbMATH Keywords

auction algorithmsdistributed blackboard modelmassively parallel computation modelmaximum \(b\)-matchingmaximum weight bipartite matchingparallel work-depth modelstreaming model

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(1)

• A weighted-to-unweighted reduction for matroid intersection

This page was built for publication: Scalable auction algorithms for bipartite maximum matching problems

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