Communication Efficient Coresets for Maximum Matching

@inproceedings{Kapralov2021CommunicationEC,
  title={Communication Efficient Coresets for Maximum Matching},
  author={Michael Kapralov and Gilbert Maystre and Jakab Tardos},
  booktitle={SOSA},
  year={2021}
}
In this paper we revisit the problem of constructing randomized composable coresets for bipartite matching. In this problem the input graph is randomly partitioned across $k$ players, each of which sends a single message to a coordinator, who then must output a good approximation to the maximum matching in the input graph. Assadi and Khanna gave the first such coreset, achieving a $1/9$-approximation by having every player send a maximum matching, i.e. at most $n/2$ words per player. The… 
2 Citations

Figures from this paper

On the Robust Communication Complexity of Bipartite Matching

TLDR
A new protocol is given based on a new notion of distribution-dependent sparsifiers which give a natural way of sparsifying graphs sampled from a known distribution and achieves a 0 .

Nearly Optimal Communication and Query Complexity of Bipartite Matching

TLDR
The algorithms and lower bounds follow from simple applications of known techniques such as cutting planes methods and set disjointness and solve general linear program in the multiparty model of communication.

References

SHOWING 1-10 OF 35 REFERENCES

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs

TLDR
New structural properties of EDCS that identify these subgraphs as sparse certificates for large matchings and small vertex covers which are quite robust to sampling and composition are identified.

Towards a Unified Theory of Sparsification for Matching Problems

TLDR
A construction of a `matching sparsifier', that is, a sparse subgraph of the given graph that preserves large matchings approximately and is robust to modifications of the graph, which leads to surprisingly simple and non-technical proofs of the above results in a unified way.

Randomized Composable Coresets for Matching and Vertex Cover

TLDR
The main insight of this work is that the intractability of matching and vertex cover in the simultaneous communication model is inherently connected to an adversarial partitioning of the underlying graph across machines.

Distributed Weighted Matching via Randomized Composable Coresets

TLDR
A simple distributed algorithm for the maximum weight matching problem on general graphs with approximation guarantee of $2+\varepsilon$ that (nearly) matches that of the sequential greedy algorithm.

Online Bipartite Matching with Amortized Replacements

TLDR
This is the first analysis to achieve a polylogarithmic number of replacements for any replacement strategy, almost matching the Ω(log n) lower bound.

On the communication and streaming complexity of maximum bipartite matching

TLDR
This work presents the first deterministic one-pass streaming (1 - 1/e)-approximation algorithm using O(n) space for this setting and introduces an e-matching cover of a bipartite graph G, which is a sparse subgraph of the original graph that preserves the size of maximum matching between every subset of vertices to within an additive en error.

Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model

TLDR
The space complexity of single-pass turnstile streaming algorithms for approximating matchings by showing that for any e > 0, Θ(n2-3e) space is both sufficient and necessary to compute an ne-approximate matching.

Maximum Matching in Turnstile Streams

TLDR
In the one-pass turnstile streaming model, in order to compute a O(n e )-approximation, space Ω(n3/2 − 4e) is required for constant error randomized algorithms, and, up to logarithmic factors, space \(\tilde{\mathrm{O}}( n^{2-2\epsilon} )\) is sufficient.

Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams

TLDR
This paper presents a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams, and considers a larger family of parameterized problems for which this primitive yields fast, small-space dynamic graph stream algorithms.

Maximum Matching in Semi-streaming with Few Passes

TLDR
Three semi-streaming algorithms for Maximum Bipartite Matching with one and two passes and a two-pass deterministic algorithm for any arrival order, built on ideas from the computation of semi-matchings.