Approximation algorithms for minimum time broadcast

Guy Kortsarz, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationTheory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings
EditorsDanny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh
PublisherSpringer Verlag
Pages67-78
Number of pages12
ISBN (Print)9783540555537
DOIs
StatePublished - 1992
Externally publishedYes
EventIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel
Duration: May 27 1992May 28 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

Other

OtherIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992
Country/TerritoryIsrael
CityHaifa
Period5/27/925/28/92

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

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

Cite this