@InProceedings{liu_et_al:LIPIcs.APPROX/RANDOM.2023.28,
author = {Liu, Quanquan C. and Ke, Yiduo and Khuller, Samir},
title = {{Scalable Auction Algorithms for Bipartite Maximum Matching Problems}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {28:1--28:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.28},
URN = {urn:nbn:de:0030-drops-188537},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.28},
annote = {Keywords: auction algorithms, maximum weight bipartite matching, maximum b-matching, distributed blackboard model, parallel work-depth model, streaming model, massively parallel computation model}
}