Approximation algorithms for minimum time broadcast

Guy Kortsarz, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations


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.

Original languageEnglish
Title of host publicationTheory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings
EditorsDanny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540555537
StatePublished - 1992
Externally publishedYes
EventIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel
Duration: 27 May 199228 May 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume601 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.


Dive into the research topics of 'Approximation algorithms for minimum time broadcast'. Together they form a unique fingerprint.

Cite this