Skip to main content
SpringerLink
Log in
Book cover

Israel Symposium on Theory of Computing and Systems

ISTCS 1992: Theory of Computing and Systems pp 67–78Cite as

Approximation algorithms for minimum time broadcast

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 601))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.M. Farley. Minimum time line broadcast network. Networks, 10:59–70, 1980.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. G. Frederickson and R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM J. on Computing, 19:164–181, 1990.

    Google Scholar 

  4. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, 1979.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.

    Google Scholar 

  7. G. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, 32:265–279, 1986.

    Google Scholar 

  8. P.J. Slater, E.J. Cockayne, and T. Hedetniemi. Information dissemination in trees. SIAM J. on Compu., 10, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, The Weizmann Institute, 76100, Rehovot, Israel

    Guy Kortsarz & David Peleg

Authors
  1. Guy Kortsarz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Dolev Z. Galil M. Rodeh

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation