Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Research output: Contribution to journal › Conference article › peer-review

39 Scopus citations

Original language	English
Pages (from-to)	438-447
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/509967.509972
State	Published - 1 Jan 2002
Externally published	Yes
Event	Proceedings of the 34th Annual ACM Symposium on Theory of Computing - Montreal, Que., Canada Duration: 19 May 2002 → 21 May 2002

ASJC Scopus subject areas

@article{e6f83dc7ff034adeb24ea6fcf53f94a8,

title = "Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem",

author = "Michael Elkin and Guy Kortsarz",

year = "2002",

month = jan,

day = "1",

doi = "10.1145/509967.509972",

language = "English",

pages = "438--447",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 34th Annual ACM Symposium on Theory of Computing ; Conference date: 19-05-2002 Through 21-05-2002",

}

TY - JOUR

T1 - Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

AU - Elkin, Michael

AU - Kortsarz, Guy

PY - 2002/1/1

Y1 - 2002/1/1

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

U2 - 10.1145/509967.509972

DO - 10.1145/509967.509972

M3 - Conference article

AN - SCOPUS:0036038483

SN - 0734-9025

SP - 438

EP - 447

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 34th Annual ACM Symposium on Theory of Computing

Y2 - 19 May 2002 through 21 May 2002

ER -