Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 438-447

  Elkin, Michael ^a   Kortsarz, Guy ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTER NETWORKS; INFORMATION THEORY; MATHEMATICAL MODELS; SET THEORY;

COMBINATORIAL LOGARITHMIC APPROXIMATION ALGORITHM; TELEPHONED BROADCAST;

COMPUTATIONAL COMPLEXITY;

EID: 0036038483     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509967.509972     Document Type: Conference Paper

References (17)

1. A lower bound for radio broadcast
2. On the complexity of broadcast in radio networks: An exponential gap between determinism and randomization
3. 3/14)-coloring algorithm for 3-colorable graphs
4. Multicasting in heterogeneous networks
5. Designing networks with bounded pairwise distance
6. Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode
7. Broadcast in radio networks
8. A new approach to the maximum flow problem
9. Approximation algorithms for NP-hard problems
10. A survey of broadcasting and gossiping in communication networks
11. On the hardness of approximating spanners
12. Approximation algorithms for minimum time broadcast
13. On the hardness of approximating minimization problems
14. Rapid rumor ramification: Approximating the minimum broadcast time
15. A parallel repetition theorem
16. On the inapproximability of broadcasting time