Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Quanquan C. Liu, Yiduo Ke, and Samir Khuller. Scalable Auction Algorithms for Bipartite Maximum Matching Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 28:1-28:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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.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} }
Published in: LIPIcs, Volume 256, 4th Symposium on Foundations of Responsible Computing (FORC 2023)
Arpita Biswas, Yiduo Ke, Samir Khuller, and Quanquan C. Liu. An Algorithmic Approach to Address Course Enrollment Challenges. In 4th Symposium on Foundations of Responsible Computing (FORC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 256, pp. 8:1-8:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{biswas_et_al:LIPIcs.FORC.2023.8, author = {Biswas, Arpita and Ke, Yiduo and Khuller, Samir and Liu, Quanquan C.}, title = {{An Algorithmic Approach to Address Course Enrollment Challenges}}, booktitle = {4th Symposium on Foundations of Responsible Computing (FORC 2023)}, pages = {8:1--8:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-272-3}, ISSN = {1868-8969}, year = {2023}, volume = {256}, editor = {Talwar, Kunal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2023.8}, URN = {urn:nbn:de:0030-drops-179297}, doi = {10.4230/LIPIcs.FORC.2023.8}, annote = {Keywords: fairness, allocation, matching, algorithms} }
Feedback for Dagstuhl Publishing