Almost-Tight Distributed Minimum Cut Algorithms

4 August 2014

Papers citing "Almost-Tight Distributed Minimum Cut Algorithms"

7 / 7 papers shown

Title
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 22 2 0 09 Nov 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 24 5 0 25 Apr 2021
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 27 21 0 20 Apr 2020
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 11 49 0 08 Nov 2018
Distributed Approximation of Minimum $k$ -edge-connected Spanning Subgraphs Michal Dory 19 16 0 20 May 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 13 32 0 18 Jan 2018
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 82 110 0 06 Jun 2012