A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
On the communication and streaming complexity of maximum bipartite matching
[chapter]
2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Consider the following communication problem. Alice holds a graph GA = (P, Q, EA) and Bob holds a graph GB = (P, Q, EB), where |P | = |Q| = n. Alice is allowed to send Bob a message m that depends only on the graph GA. Bob must then output a matching M ⊆ EA ∪ EB. What is the minimum message size of the message m that Alice sends to Bob that allows Bob to recover a matching of size at least (1 − ) times the maximum matching in GA ∪ GB? The minimum message length is the one-round communication
doi:10.1137/1.9781611973099.41
dblp:conf/soda/GoelKK12
fatcat:gzjojswvznbche36dlffke5rzi