Approximation algorithms for minimum time broadcast

Guy Kortsarz; David Peleg

doi:10.1007/bfb0035167

Approximation algorithms for minimum time broadcast

Guy Kortsarz, David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 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 language	English
Title of host publication	Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings
Editors	Danny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh
Publisher	Springer Verlag
Pages	67-78
Number of pages	12
ISBN (Print)	9783540555537
DOIs	https://doi.org/10.1007/bfb0035167
State	Published - 1992
Externally published	Yes
Event	Israel Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel Duration: 27 May 1992 → 28 May 1992

Publication series

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

Conference

Conference	Israel Symposium on the Theory of Computing and Systems, ISTCS 1992
Country/Territory	Israel
City	Haifa
Period	27/05/92 → 28/05/92

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

Access to Document

10.1007/bfb0035167

Cite this

Kortsarz, G., & Peleg, D. (1992). Approximation algorithms for minimum time broadcast. In D. Dolev, Z. Galil, Z. Galil, & M. Rodeh (Eds.), Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings (pp. 67-78). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 601 LNCS). Springer Verlag. https://doi.org/10.1007/bfb0035167

Kortsarz, Guy ; Peleg, David. / Approximation algorithms for minimum time broadcast. Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings. editor / Danny Dolev ; Zvi Galil ; Zvi Galil ; Michael Rodeh. Springer Verlag, 1992. pp. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{470f59db98094c00bdc8ab3aa151c42d,

title = "Approximation algorithms for minimum time broadcast",

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.",

author = "Guy Kortsarz and David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; Israel Symposium on the Theory of Computing and Systems, ISTCS 1992 ; Conference date: 27-05-1992 Through 28-05-1992",

year = "1992",

doi = "10.1007/bfb0035167",

language = "אנגלית",

isbn = "9783540555537",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "67--78",

editor = "Danny Dolev and Zvi Galil and Zvi Galil and Michael Rodeh",

booktitle = "Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings",

address = "גרמניה",

}

Kortsarz, G & Peleg, D 1992, Approximation algorithms for minimum time broadcast. in D Dolev, Z Galil, Z Galil & M Rodeh (eds), Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 601 LNCS, Springer Verlag, pp. 67-78, Israel Symposium on the Theory of Computing and Systems, ISTCS 1992, Haifa, Israel, 27/05/92. https://doi.org/10.1007/bfb0035167

Approximation algorithms for minimum time broadcast. / Kortsarz, Guy; Peleg, David.
Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings. ed. / Danny Dolev; Zvi Galil; Zvi Galil; Michael Rodeh. Springer Verlag, 1992. p. 67-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 601 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximation algorithms for minimum time broadcast

AU - Kortsarz, Guy

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1992.

PY - 1992

Y1 - 1992

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

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

UR - http://www.scopus.com/inward/record.url?scp=85029442792&partnerID=8YFLogxK

U2 - 10.1007/bfb0035167

DO - 10.1007/bfb0035167

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85029442792

SN - 9783540555537

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 67

EP - 78

BT - Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings

A2 - Dolev, Danny

A2 - Galil, Zvi

A2 - Rodeh, Michael

PB - Springer Verlag

T2 - Israel Symposium on the Theory of Computing and Systems, ISTCS 1992

Y2 - 27 May 1992 through 28 May 1992

ER -

Kortsarz G, Peleg D. Approximation algorithms for minimum time broadcast. In Dolev D, Galil Z, Galil Z, Rodeh M, editors, Theory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings. Springer Verlag. 1992. p. 67-78. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/bfb0035167

Approximation algorithms for minimum time broadcast

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this