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

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

8 November 2017

Vahab Mirrokni

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

8 / 8 papers shown

Title
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 40 130 0 22 Feb 2018
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 56 99 0 11 Jul 2017
Randomized Composable Coresets for Matching and Vertex Cover Sepehr Assadi S. Khanna 28 49 0 23 May 2017
A New Framework for Distributed Submodular Maximization R. Barbosa Alina Ene Huy Le Nguyen Justin Ward 36 87 0 14 Jul 2015
Randomized Composable Core-sets for Distributed Submodular Maximization Vahab Mirrokni Morteza Zadimoghaddam 92 128 0 22 Jun 2015
The Power of Randomization: Distributed Submodular Maximization on Massive Datasets R. Barbosa Alina Ene Huy Le Nguyen Justin Ward 108 103 0 09 Feb 2015
Parallel Algorithms for Geometric Graph Problems Alexandr Andoni Aleksandar Nikolov Krzysztof Onak G. Yaroslavtsev 131 178 0 30 Dec 2013
Sorting, Searching, and Simulation in the MapReduce Framework M. Goodrich Nodari Sitchinava Qin Zhang 66 248 0 10 Jan 2011