Communication complexity of approximate maximum matching in the message-passing model release_bvjfnlx5mne7fo6df2nxpgbdom

by Zengfeng Huang, Bozidar Radunovic, Milan Vojnovic, Qin Zhang

Released as a article .

2017  

Abstract

We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems, with a variety of applications. The input to the problem is a graph G that has n vertices and the set of edges partitioned over k sites, and an approximation ratio parameter α. The output is required to be a matching in G that has to be reported by one of the sites, whose size is at least factor α of the size of a maximum matching in G. We show that the communication complexity of this problem is Ω(α^2 k n) information bits. This bound is shown to be tight up to a n factor, by constructing an algorithm, establishing its correctness, and an upper bound on the communication cost. The lower bound also applies to other graph combinatorial problems in the message-passing communication model, including max-flow and graph sparsification.
In text/plain format

Archived Files and Locations

application/pdf  318.2 kB
file_mbcvnnr4jjgophwphg4ou6ivaa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-04-27
Version   v1
Language   en ?
arXiv  1704.08462v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 8662d586-8930-45ae-8225-e77aebaf5ced
API URL: JSON