A heuristic for broadcasting in arbitrary networks
Finding the optimal broadcasting schedule in an arbitrary network is an NP-hard problem. Many papers have been published on the topic of finding an efficient and effective heuristic for broadcasting. In this thesis, a heuristic algorithm for broadcasting in arbitrary networks is presented. This heur...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2002
|
| Online Access: | http://spectrum.library.concordia.ca/2118/1/MQ77719.pdf Shao, Bin <http://spectrum.library.concordia.ca/view/creators/Shao=3ABin=3A=3A.html> (2002) A heuristic for broadcasting in arbitrary networks. Masters thesis, Concordia University. |