v1v2v3 (latest)

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"

36 / 36 papers shown

Title
Massively Parallel Algorithms for Approximate Shortest Paths Michal Dory Shaked Matar 101 1 0 09 Dec 2024
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling Laxman Dhulipala Michael Dinitz Jakub Łącki Slobodan Mitrović 22 3 0 23 Aug 2024
Dataset Distillation by Automatic Training Trajectories Dai Liu Jindong Gu Hu Cao Carsten Trinitis Martin Schulz DD 87 12 0 19 Jul 2024
No Dimensional Sampling Coresets for Classification M. Alishahi Jeff M. Phillips 109 2 0 07 Feb 2024
One Pass Streaming Algorithm for Super Long Token Attention Approximation in Sublinear Space Raghav Addanki Chenyang Li Zhao Song Chiwun Yang 85 3 0 24 Nov 2023
Massively Parallel Algorithms for $b$ -Matching M. Ghaffari Christoph Grunau Slobodan Mitrovic FedML 44 7 0 14 Nov 2022
New Coresets for Projective Clustering and Applications M. Tukan Xuan Wu Samson Zhou Vladimir Braverman Dan Feldman 79 20 0 08 Mar 2022
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings S. Faour Marc Fuchs Fabian Kuhn 46 11 0 20 Nov 2021
Adaptive Massively Parallel Constant-round Tree Contraction Mohammadtaghi Hajiaghayi Marina Knittel Hamed Saleh Hsin-Hao Su 23 3 0 02 Nov 2021
Deterministic Massively Parallel Connectivity Samantha R. Coy A. Czumaj 81 18 0 09 Aug 2021
Component Stability in Low-Space Massively Parallel Computation A. Czumaj Peter Davies M. Parter 61 24 0 03 Jun 2021
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni W. Schudy 56 13 0 24 Sep 2020
A Massively Parallel Algorithm for Minimum Weight Vertex Cover M. Ghaffari Ce Jin Daan Nilis 62 14 0 21 May 2020
Massively Parallel Algorithms for Distance Approximation and Spanners Amartya Shankha Biswas Michal Dory M. Ghaffari Slobodan Mitrović Yasamin Nazari 76 20 0 02 Mar 2020
$Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation$ Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi 34 26 0 27 Feb 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond M. Ghaffari Christoph Grunau Ce Jin 62 30 0 22 Feb 2020
Massively Parallel Algorithms for Small Subgraph Counting Amartya Shankha Biswas T. Eden Quanquan C. Liu Slobodan Mitrović R. Rubinfeld 62 8 0 19 Feb 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 62 8 0 18 Feb 2020
Equivalence Classes and Conditional Hardness in Massively Parallel Computations Danupon Nanongkai Michele Scquizzato 63 18 0 07 Jan 2020
New lower bounds for Massively Parallel Computation from query complexity Moses Charikar Weiyun Ma Li-Yang Tan 39 1 0 05 Jan 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 83 29 0 11 Dec 2019
Near-Optimal Massively Parallel Graph Connectivity Soheil Behnezhad Laxman Dhulipala Hossein Esfandiari Jakub Lacki Vahab Mirrokni 75 52 0 11 Oct 2019
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 157 50 0 02 Sep 2019
Distributed Weighted Matching via Randomized Composable Coresets Sepehr Assadi M. Bateni Vahab Mirrokni 42 8 0 05 Jun 2019
Dynamic Algorithms for the Massively Parallel Computation Model G. Italiano Silvio Lattanzi Vahab S. Mirrokni Nikos Parotsidis 41 27 0 22 May 2019
Log Diameter Rounds Algorithms for $2$ -Vertex and $2$ -Edge Connectivity Alexandr Andoni C. Stein Peilin Zhong 32 19 0 02 May 2019
Exponentially Faster Massively Parallel Maximal Matching Soheil Behnezhad Mohammadtaghi Hajiaghayi David G. Harris 99 62 0 11 Jan 2019
Weighted Matchings via Unweighted Augmentations Buddhima Gamlath S. Kale Slobodan Mitrovic William Yang Wang 67 66 0 07 Nov 2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space Krzysztof Onak 62 30 0 23 Jul 2018
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi R. Karp 52 18 0 17 Jul 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation M. Ghaffari Jara Uitto 61 103 0 17 Jul 2018
Parallel Graph Connectivity in Log Diameter Rounds Alexandr Andoni C. Stein Zhao Song Zhengyu Wang Peilin Zhong 57 99 0 08 May 2018
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs Sepehr Assadi Xiaorui Sun Omri Weinstein 54 58 0 08 May 2018
Semi-MapReduce Meets Congested Clique Soheil Behnezhad Mahsa Derakhshan Mohammadtaghi Hajiaghayi GNN 39 9 0 28 Feb 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover M. Ghaffari Themis Gouleakis Christian Konrad Slobodan Mitrovic R. Rubinfeld 98 132 0 22 Feb 2018
Round Compression for Parallel Matching Algorithms A. Czumaj Jakub Lacki Aleksander Madry Slobodan Mitrovic Krzysztof Onak Piotr Sankowski 85 101 0 11 Jul 2017