On the Robust Communication Complexity of Bipartite Matching
From MaRDI portal
Publication:6070391
DOI10.4230/lipics.approx/random.2021.48OpenAlexW3204098402MaRDI QIDQ6070391
Soheil Behnezhad, Sepehr Assadi
Publication date: 20 November 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14741/pdf/LIPIcs-APPROX48.pdf/
This page was built for publication: On the Robust Communication Complexity of Bipartite Matching