A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model

6 June 2012

Papers citing "A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model"

8 / 8 papers shown

Title
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 12 10 0 06 Nov 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 13 49 0 08 Nov 2018
Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model A. Mashreghi Valerie King 30 29 0 12 Jun 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms Bernhard Haeupler Jason Li Goran Zuzic 19 32 0 18 Jan 2018
Almost-Tight Distributed Minimum Cut Algorithms Danupon Nanongkai Hsin-Hao Su 55 54 0 04 Aug 2014
Distributed Random Walks Atish Das Sarma Danupon Nanongkai Gopal Pandurangan P. Tetali 119 65 0 19 Feb 2013
Dense Subgraphs on Dynamic Networks Atish Das Sarma Ashwin Lall Danupon Nanongkai Amitabh Trehan 78 21 0 07 Aug 2012
Efficient Computation of Distance Sketches in Distributed Networks Atish Das Sarma M. Dinitz Gopal Pandurangan 72 11 0 06 Dec 2011