TY - GEN
T1 - Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
AU - Elkin, Michael
AU - Kortsarz, Guy
PY - 2002
Y1 - 2002
N2 - Several approximation algorithms with polylogarithmic ration, including one with logarithmic ration, for the undirected variants of the telephone multicast problems are known. However, all these algorithms involve solving large linear programs. Thus, a combinatorial logarithmic approximation algorithm for these problems, that applies also for the directed broadcast problem is devised.
AB - Several approximation algorithms with polylogarithmic ration, including one with logarithmic ration, for the undirected variants of the telephone multicast problems are known. However, all these algorithms involve solving large linear programs. Thus, a combinatorial logarithmic approximation algorithm for these problems, that applies also for the directed broadcast problem is devised.
UR - https://www.scopus.com/pages/publications/0036038483
U2 - 10.1145/509967.509972
DO - 10.1145/509967.509972
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0036038483
SN - 9781581134957
T3 - Conference Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 438
EP - 447
BT - Proceedings of the 34th Annual ACM Symposium on Theory of Computing
PB - Association for Computing Machinery (ACM)
T2 - 34th Annual ACM Symposium on Theory of Computing, STOC 2002
Y2 - 19 May 2002 through 21 May 2002
ER -