Broadcast networks of bounded degree
SIAM Journal on Discrete Mathematics
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Broadcasting in butterfly and deBruijn networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Approximation Algorithms for Minimum-Time Broadcast
SIAM Journal on Discrete Mathematics
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Approximation algorithms for broadcasting and gossiping
Journal of Parallel and Distributed 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
Randomized Broadcast in Networks
SIGAL '90 Proceedings of the International Symposium on Algorithms
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
IEEE Transactions on Computers
Rapid rumor ramification: approximating the minimum broadcast time
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
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
Broadcasting in necklace graphs
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Linear algorithm for broadcasting in unicyclic graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
In this paper, we present a heuristic for broadcasting in arbitrary networks. This heuristic generates optimal broadcast time for ring, tree and grid graphs when the originator is a corner vertex. In practice, the new heuristic outperforms the best known broadcast algorithms for three different network models. The time complexity of one round of the heuristic is O(|E|), where |E| stand for the number of edges of the network.