Abstract
This paper deals with the problem of broadcasting in minimum time. Approximation algorithms are developed for arbitrary graphs, as well as for several restricted graph classes.
Supported in part by an Allon Fellowship, by a Bantrell Fellowship and by a Walter and Elise Haas Career Development Award.
Preview
Unable to display preview. Download preview PDF.
References
A.M. Farley. Minimum time line broadcast network. Networks, 10:59–70, 1980.
A. Farley and S. Hedetniemi. Broadcasting in grid graphs. In Proc. Ninth South-eastern Conf. on Combin., Graph Theory and Comput., pages 275–288, 1978.
G. Frederickson and R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM J. on Computing, 19:164–181, 1990.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, 1979.
J.R. Gilbert, D.J. Rose, and A. Edenbrandt. A separator theorem for chordal graphs. SIAM J. Alg. and Disc. Meth., 5:306–313, 1984.
S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.
G. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, 32:265–279, 1986.
P.J. Slater, E.J. Cockayne, and T. Hedetniemi. Information dissemination in trees. SIAM J. on Compu., 10, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kortsarz, G., Peleg, D. (1992). Approximation algorithms for minimum time broadcast. In: Dolev, D., Galil, Z., Rodeh, M. (eds) Theory of Computing and Systems. ISTCS 1992. Lecture Notes in Computer Science, vol 601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035167
Download citation
DOI: https://doi.org/10.1007/BFb0035167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55553-7
Online ISBN: 978-3-540-47214-8
eBook Packages: Springer Book Archive