Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Michael Elkin; Guy Kortsarz

doi:10.1145/509967.509972

Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Michael Elkin
, Guy Kortsarz

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

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 34th Annual ACM Symposium on Theory of Computing
Publisher	Association for Computing Machinery (ACM)
Pages	438-447
Number of pages	10
ISBN (Print)	9781581134957
DOIs	https://doi.org/10.1145/509967.509972
State	Published - 2002
Externally published	Yes
Event	34th Annual ACM Symposium on Theory of Computing, STOC 2002 - Montreal, Que., Canada Duration: 19 May 2002 → 21 May 2002

Publication series

Name	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)	0734-9025

Conference

Conference	34th Annual ACM Symposium on Theory of Computing, STOC 2002
Country/Territory	Canada
City	Montreal, Que.
Period	19/05/02 → 21/05/02

Access to Document

10.1145/509967.509972

Cite this

@inproceedings{2066240e2c7c47878843c9c3172a8cfa,

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

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

author = "Michael Elkin and Guy Kortsarz",

year = "2002",

doi = "10.1145/509967.509972",

language = "אנגלית",

isbn = "9781581134957",

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

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

pages = "438--447",

booktitle = "Proceedings of the 34th Annual ACM Symposium on Theory of Computing",

address = "ארצות הברית",

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

}

Elkin, M & Kortsarz, G 2002, Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. in Proceedings of the 34th Annual ACM Symposium on Theory of Computing. Conference Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery (ACM), pp. 438-447, 34th Annual ACM Symposium on Theory of Computing, STOC 2002, Montreal, Que., Canada, 19/05/02. https://doi.org/10.1145/509967.509972

Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. / Elkin, Michael; Kortsarz, Guy.
Proceedings of the 34th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), 2002. p. 438-447 (Conference Proceedings of the Annual ACM Symposium on Theory of Computing).

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

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 -

Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this