Abstract
Consider 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, and to send him 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 \( \tau \subseteq V,\left| \tau \right| = k \). The processors of V \ \( \tau \) may be left uninformed. The telephone multicast is a basic primitive in distributed computing and computer communication theory. In this paper we devise an algorithm that constructs a schedule with O(max{log k, log n/log k} • br* + k 1/2) rounds for the directed k-multicast problem, where br* is the value of the optimum solution. This significantly improves the previously best-known approximation ratio of O(k 1/3 • log n • br* + k 2/3) due to [EK03].
We show that our algorithm for the directed multicast problem can be used to derive an algorithm with a similar ratio for the directed minimum poise Steiner arborescence problem, that is, the problem of constructing an arborescence that spans a collection \( \tau \) of terminals, minimizing the sum of height of the arborescence plus maximum out-degree in the arborescence.
This material is based upon work supported by the National Science Foundation under agreement No. DMS-9729992. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, 1992.
A. Bar-noy, S. Guha, J. Naor and B. Schieber. Multicasting in Heterogeneous Networks, In Proc. of 30th ACM Annual Symp. on Theory of Computing 1998.
A. Bar-Noy and S. Kipnis, “Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems,” Mathematical System Theory, Vol. 27, pp. 431–452, 1994.
H. Chernoff, A measure of asymptotic efficiency for tests of an hypothesis based on the sum of observations, Annals of Mathematical Statistics, 23:493–509, 1952.
M. Elkin and G. Kortsarz, A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem, In Proc. of 34th ACM Annual Symp. on Theory of Computing, pp. 438–447, 2002.
M. Elkin and G. Kortsarz, A sublogarithmic approximation algorithm for the undirected telephone broadcast problem: a path out of a jungle. In Proc. of 14th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 76–85, 2003.
P. Fraigniaud Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode, In 9th Annual European Symposium. on Algorithms (ESA’ 01), LNCS Vol. 2161, pp. 440–451, 2001.
M. Furer and B. Raghavachari. An NC approximation algorithm for the minimum degree spanning tree problem. In Proc. of the 28th Annual Allerton Conf. on Communication, Control and Computing, pp. 274–281, 1990.
S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of broadcasting and gossiping in communication networks. Networks, 18: 319–349, 1988.
H. B. Hunt, M. V. Marathe, R. Sundaram, R. Ravi, S. S. Ravi and D. J. Rosenkrantz. Bicriteria network design problems, Journal of Algorithms, Vol. 28, No. 1, 142–171 (1998).
L. G. Khachiyan. A Polynomial Algorithm in Linear Programming, Doklady Akademii Nauk SSSR 244, pp. 1093–1096, 1979.
N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol. 4(1984), pp. 373–396.
G. Kortsarz and D. Peleg. Approximation algorithms for minimum time broadcast, SIAM journal on discrete methods, vol. 8, pp. 401–427, 1995.
L. K. Lenstra and D. Shmoys and E. Tardos, “Approximation algorithms for scheduling unrelated parallel machines”, Math. Programming, 46, 259–271. (1990).
R. Krishnan and B. Raghavachari. The Directed Minimum-Degree Spanning Tree Problem. FSTTCS 2001, 232–243.
M. Middendorf. Minimum Broadcast Time is NP-complete for 3-regular planar graphs and deadline 2. Inf. Process. Lett. 46 (1993) 281–287.
R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
S. A. Plotkin and D. B. Shmoys and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 1995, 257–301.
P. Raghavan, probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of computer and system sciences, 37:130–143,1988.
R. Ravi, Rapid rumor ramification: Approximating the minimum broadcast time. In Proc. of the IEEE Symp. on Foundations of Computer Science (FOCS’ 94), pp. 202–213, 1994.
R. Raz, S. Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP, in Proc. of the 29th Symp. on Theory of Comp., pp. 475–484, 1997.
P. Raghavan and C. Thompson, Randomized Rounding, Combinatorica, vol. 7, pp. 365–374, 1987.
C. Schindelhauer, On the Inapproximability of Broadcasting Time, In The 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’00), 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkin, M., Kortsarz, G. (2003). Approximation Algorithm for Directed Telephone Multicast Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_19
Download citation
DOI: https://doi.org/10.1007/3-540-45061-0_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40493-4
Online ISBN: 978-3-540-45061-0
eBook Packages: Springer Book Archive