A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem

Consider a synchronous network of processors, modeled by directed or undirected graph $G = (V,E)$, in which in each round every processor is allowed to choose one of its neighbors and to send a message to this neighbor. Given a processor $s \in V$ and a subset $T \subseteq V$ of processors, the tele...

Ausführliche Beschreibung