Sublogarithmic approximation for telephone multicast: Path out of jungle

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 76-85

  Elkin, Michael ^a,b   Kortsarz, Guy ^c  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; SCHEDULING; TELEPHONE;

COMPUTER COMMUNICATION THEORY; SUBLOGARITHMIC APPROXIMATION; TELEPHONE MULTICAST;

MULTICASTING;

EID: 0038754773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. S. Arora, C. Lund. Hardness of Approximation, in Approximation Algorithms for NP-hard Problems, D. Hochbaum Ed., pp. 399-440, (PWS Publishing Company), 1997.
2. A. Bar-noy, S. Guha, J. Naor and B. Schieber, Multicasting in Heterogeneous Networks In Proc. of ACM Symp. on Theory of Computing 1998.
3. M. Elkin and G. Kortsarz. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem, Proc. of ACM Symp. on Theory of Computing 2002, pages 438-447.
4. P. Fraigniaud. Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode In 9th Annual European Symposium on Algorithms (ESA '01), LNCS Vol. 2161, pages 440-451, 2001.
5. S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of broadcasting and gossiping in communication networks. Networks, 18: 319-349, 1988.
6. G. Kortsarz and D. Peleg. Approximation algorithms for minimum time broadcast. SIAM journal on discrete methods, vol 8, pages 401-427, 1995.
7. L. K. Lenstra and D. Shmoys and E. Tardos, "Approximation algorithms for scheduling unrelated parallel machines", Math. Programming, 46, 259-271. (1990).
8. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS '94), 202-213 (1994).
9. R. Raz, S. Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. in Proc. of ACM Symp. on Theory of Computing 1997, pages 475-484.
10. P. Raghavan and C. Thompson. Randomized Rounding, Combinatorica, volume 7, pages 365-374, 1987.