Almost-Tight Distributed Minimum Cut Algorithms

4 August 2014

Papers citing "Almost-Tight Distributed Minimum Cut Algorithms"

9 / 9 papers shown

Title
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 32 2 0 09 Nov 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 37 5 0 25 Apr 2021
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 36 21 0 20 Apr 2020
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 15 41 0 24 May 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 16 49 0 08 Nov 2018
Distributed Approximation of Minimum $k$ -edge-connected Spanning Subgraphs Michal Dory 21 16 0 20 May 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 27 32 0 18 Jan 2018
Triangle Finding and Listing in CONGEST Networks Taisuke Izumi F. Gall 19 55 0 25 May 2017
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 93 109 0 06 Jun 2012