Approximation of Distances and Shortest Paths in the Broadcast Congest Clique

Abstract

We study the broadcast version of the CONGEST-CLIQUE model of distributed computing [8, 22, 25]. In this model, in each round, any node in a network of size n can send the same message (i.e. broadcast a message) of limited size to every other node in the network. Nanongkai presented in [STOC’14 [25]] a randomized (2 + o(1))-approximation algorithm to… (More)
DOI: 10.4230/LIPIcs.OPODIS.2015.6

3 Figures and Tables

Topics

Statistics

01020201520162017
Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics