Michael Elkin
ABSTRACT
(MATH) Consider a synchronous network of processors, modeled by directed or undirected graph G = (V,E), in which on each round every processor is allowed to choose one of its neighbors and to send him a message. Given a processor s ε V, and a subset T ⊆ V of processors, the telephone multicast problem requires to compute the shortest schedule (in terms of the number of rounds) that delivers a message from s to all the processors of T. The particular case T = V is called telephone broadcast problem.These problems have multiple applications in distributed computing. Several approximation algorithms with polylogarithmic ratio, including one with logarithmic ratio, for the undirected variants of these problems are known. However, all these algorithms involve solving large linear programs. Devising a polylogarithmic approximation algorithm for the directed variants of these problems is anopen problem, posed in [15].We devise a combinatorial logarithmic approximation algorithm for these problems, that applies also for the directed broadcast problem. Our algorithm has significantly smaller running time, and seems to reveal more information about the combinatorial structure of the solution, than the previous algorithms, that are based on linear programming.(MATH) We also improve the lower bounds on the approximation threshold of these problems. Both problems are known to be 3/2-inapproximable. For the undirected (resp., directed) broadcast problem we show that it is NP-hard (resp., impossible unless $NP ⊇ DTIME(nO(log n))) to approximate it within a ratio of 3 —ε for any ε ρ 0 (resp., ω(\sqrt log n)).Finally, we study the radio broadcast problem. Its setting is similar to the telephone broadcast problem, but in every round every processor may either send a message to all its neighbors or may not send it at all. A processor is informed in a certain round if and only if it receives a message from precisely one neighbor.(MATH) This problem was known to admit O(log2 n)-approximation algorithm, but no hardness of approximation was known. In this paper we show that the problem is ω(log n)-inapproximable unless NP ⊆ BPTIME(nlog log n}).
- N. Alon, A. Bar-Noy, N. Linial, D. Peleg. A lower bound for radio broadcast. In Journal of Computer and System Sciences 43, pp. 290--298, 1991.]] Google Scholar
Digital Library
- R. Bar-Yehuda. Private communication.]]Google Scholar
- R. Bar-Yehuda, O. Goldreich, A.Itai. On the complexity of broadcast in radio networks: An exponential gap between determinism and randomization. In Proc. to the 6th Annual ACM Symp. on Principles of Distributed Computing, pp. 98--108, August, 1987.]] Google ScholarDigital Library
- A. Blum, D. Karger. An O(n3/14)-Coloring Algorithm for 3-Colorable Graphs. Information Processing Letters, 61(1):49--53, 1997.]] Google ScholarDigital Library
- A. Bar-Noy, S. Guha, J. Naor, B. Schieber. Multicasting in Heterogeneous Networks In Proc. of ACM Symp. on Theory of Computing, 1998.]] Google ScholarDigital Library
- Y. Dodis, S. Khanna. Designing Networks with Bounded Pairwise Distance. Proc. 30th ACM Ann. Symp. of Theory of Computing, 1999.]] Google ScholarDigital Library
- P. Fraigniaud. Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode. In 9th Annual European Symp. on Algorithms (ESA '01), LNCS Vol. 2161, pages 440--451, 2001.]] Google ScholarDigital Library
- I. Gaber, Y. Mansour. Broadcast in Radio Networks. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 577--585, 1995.]] Google ScholarDigital Library
- A. V. Goldberg, R. E. Tarjan. A new approach to the maximum flow problem. Journal of ACM, 35:921--940, 1988.]] Google ScholarDigital Library
- Edited by Dorit S. Hochbaum. Approximation Algorithms for NP-Hard Problems PWS Publishing Company, Boston, MA, 1995.]]Google Scholar
- S. Hedetniemi, S. Hedetniemi, A. Liestman. A survey of broadcasting and gossiping in communication networks. Networks, 18: 319--349, 1988.]]Google ScholarCross Ref
- G. Kortsarz. On the hardness of approximating spanners. The first International Workshop APPROX-98, pages 135--146, 1998.]] Google ScholarDigital Library
- G. Kortsarz, D. Peleg. Approximation algorithms for minimum time broadcast, SIAM Journal on discrete methods, vol 8, pages 401--427, 1995.]] Google ScholarDigital Library
- C. Lund, M. Yannakakis. On the hardness of approximating minimization problems. J. Assoc. Comput. Mach., 41(5):960--981, 1994.]] Google ScholarDigital Library
- R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. Proc. of the IEEE Symp. on Foundations of Computer Science (FOCS '94), 202--213, 1994.]]Google ScholarDigital Library
- R. Raz. A Parallel Repetition Theorem. SIAM Journal of computing 27(3)(1998) pp. 763--803.]] Google ScholarDigital Library
- C. Schindelhauer. On the Inapproximability of Broadcasting Time. In The 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'00), 2000.]] Google ScholarDigital Library
Index Terms
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
Recommendations
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 ...
Approximation algorithm for directed telephone multicast problem
ICALP'03: Proceedings of the 30th international conference on Automata, languages and programmingConsider a network of processors modeled by an n-vertex directed 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, ...
Logarithmic inapproximability of the radio broadcast problem
We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME (nO(log log n)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to ...
Comments