A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Simple Round Compression for Parallel Vertex Cover
[article]
2017
arXiv
pre-print
Recently, Czumaj et.al. (arXiv 2017) presented a parallel (almost) 2-approximation algorithm for the maximum matching problem in only O((n)^2) rounds of the massive parallel computation (MPC) framework, when the memory per machine is O(n). The main approach in their work is a way of compressing O(n) rounds of a distributed algorithm for maximum matching into only O((n)^2) MPC rounds. In this note, we present a similar algorithm for the closely related problem of approximating the minimum vertex
arXiv:1709.04599v1
fatcat:q3kyiuzginebhjvmzljmvkmeuy