A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph

9 November 2022

Papers citing "A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$-Edge-Connected Spanning Subgraph"

5 / 5 papers shown

Title
Stochastic Distance in Property Testing Uri Meir Gregory Schwartzman Yuichi Yoshida 17 0 0 19 Jul 2024
Fast Broadcast in Highly Connected Networks Shashwat Chandra Yi-Jun Chang Michal Dory Mohsen Ghaffari Dean Leitersdorf 24 1 0 19 Apr 2024
Õptimal Vertex Fault-Tolerant Spanners in Õptimal Time: Sequential, Distributed and Parallel M. Parter LRM 11 3 0 07 Sep 2022
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 90 49 0 02 Sep 2019
Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model A. Mashreghi Valerie King 25 29 0 12 Jun 2018