Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

Published 22 Feb 2018 in cs.DS and cs.DC | (1802.08237v4)

Abstract: We present O(log⁡log⁡n)O(\log\log n)-round algorithms in the Massively Parallel Computation (MPC) model, with O~(n)\tilde{O}(n) memory per machine, that compute a maximal independent set, a 1+ϵ1+\epsilon approximation of maximum matching, and a 2+ϵ2+\epsilon approximation of minimum vertex cover, for any nn-vertex graph and any constant ϵ>0\epsilon>0. These improve the state of the art as follows: - Our MIS algorithm leads to a simple O(log⁡log⁡Δ)O(\log\log \Delta)-round MIS algorithm in the Congested Clique model of distributed computing, which improves on the O~(log⁡Δ)\tilde{O}(\sqrt{\log \Delta})-round algorithm of Ghaffari [PODC'17]. - Our O(log⁡log⁡n)O(\log\log n)-round (1+ϵ)(1+\epsilon)-approximate maximum matching algorithm simplifies or improves on the following prior work: O(log⁡2log⁡n)O(\log^2\log n)-round (1+ϵ)(1+\epsilon)-approximation algorithm of Czumaj et al. [STOC'18] and O(log⁡log⁡n)O(\log\log n)-round (1+ϵ)(1+\epsilon)-approximation algorithm of Assadi et al. [SODA'19]. - Our O(log⁡log⁡n)O(\log\log n)-round (2+ϵ)(2+\epsilon)-approximate minimum vertex cover algorithm improves on an O(log⁡log⁡n)O(\log\log n)-round O(1)O(1)-approximation of Assadi et al. [arXiv'17].

Citations (128)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.