21 citations · 28 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DC2014★ 21 cited
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
Stephan Holzer, Nathan Pinsker
We study the broadcast version of the CONGEST CLIQUE model of distributed computing. In this model, in each round, any node in a network of size can send the same message (i.e.…
cs.DC2014★ 1 cited
Distributed Approximation of Minimum Routing Cost Trees
Alexandra Hochuli, Stephan Holzer, Roger Wattenhofer
We study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to…