Multicasting in heterogeneous networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
A note on line broadcast in digraphs under the edge-disjoint paths mode
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
An efficient heuristic for broadcasting in networks
Journal of Parallel and Distributed Computing
Sublogarithmic approximation for telephone multicast
Journal of Computer and System Sciences
On the number of broadcast schemes in networks
Information Processing Letters
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
IEEE/ACM Transactions on Networking (TON)
Efficient heuristics for message dissemination in networks
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
This paper deals with the problem of broadcasting in minimum time in the telephone and message-passing models. Approximation algorithms are developed for arbitrary graphs as well as for several restricted graph classes. In particular, an $O(\sqrt{n})$-additive approximation algorithm is given for broadcasting in general graphs, and an $O(\log n/\log\log n)$ (multiplicative) ratio approximation is given for broadcasting in the open-path model. This also results in an algorithm for broadcasting on random graphs (in the telephone and message-passing model) that yields an $O(\log n/\log\log n)$ approximation with high probability. In addition, the paper presents a broadcast algorithm for graph families with small separators (such as chordal, $k$-outerplanar, bounded-face planar, and series-parallel graphs), with approximation ratio proportional to the separator size times $\log n$. Finally, an efficient approximation algorithm is presented for the class of graphs representable as trees of cliques.