3 citations · 6 across the 3 of their papers we have counts for
1 paper · 1 filter
Jacques Dark, Christian Konrad
In this paper, we give simple optimal lower bounds on the one-way two-party communication complexity of approximate Maximum Matching and Minimum Vertex Cover with deletions. In our…