Semi-Robust Communication Complexity of Maximum Matching
Gabriel Cipriani Huete, Adithya Diddapur, Pavel Dvo\v{r}\'ak, Christian Konrad

TL;DR
This paper investigates the communication complexity of maximum matching in a semi-robust setting, showing a simple protocol achieves a 3/4-approximation, which is tight and also applies to the fully robust setting.
Contribution
It introduces a simple, effective protocol for semi-robust maximum matching and analyzes its approximation ratio, establishing tight bounds and implications for the fully robust setting.
Findings
Simple protocol achieves 3/4-approximation in semi-robust setting
Analysis is tight, with an example showing only 0.832-approximation in some cases
Protocol also yields 3/4-approximation in fully robust setting
Abstract
We study the one-way two-party communication complexity of Maximum Matching in the semi-robust setting where the edges of a maximum matching are randomly partitioned between Alice and Bob, but all remaining edges of the input graph are adversarially partitioned between the two parties. We show that the simple protocol where Alice solely communicates a lexicographically-first maximum matching of their edges to Bob is surprisingly powerful: We prove that it yields a -approximation in expectation and that our analysis is tight. The semi-robust setting is at least as hard as the fully robust setting. In this setting, all edges of the input graph are randomly partitioned between Alice and Bob, and the state-of-the-art result is a fairly involved -approximation protocol that is based on the computation of edge-degree constrained subgraphs [Azarmehr, Behnezhad, ICALP'23]. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Distributed systems and fault tolerance · Cryptography and Data Security
