Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
Michael Elkin, Guy Kortsarz · Symposium on Discrete Algorithms · 2003
Consider a network of processors modeled by an n-vertex graph G = (V, E). Assume that the communication in the network is synchronous, i.e., occurs in discrete rounds, and in every round every processor is allowed to pick one of its neighbors, and to send it a message. The telephone k-multicast problem requires to compute a schedule with minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processors of a given set T ⊆ V, vTv = k, whereas the processors of V T may be left uninformed. The case T = V is called broadcast problem.The telephone multicast and broadcast are basic primitives in distributed computing and computer communication theory. Several approximation algorithms with a polylogarithmic ratio were suggested for these problems, and the upper bound on their approximation threshold stands currently on O(log k) and O(log n), respectively.In this paper we devise an O(log k/log log k)-approximation algorithm for the k-multicast problem, and, consequently, an O(log n/log log n)-approximation algorithm for the broadcast problem. Even stronger than that, whenever an instance of the k-multicast problem admits a schedule of length br*, our algorithm guarantees an approximation ratio of O(log k/log br*). As br* is always at least log k, the ratio of O(log k/log log k) follows. In addition, whenever br* = Ω(kδ) for some constant δ