Heuristics for the Minimum Broadcast Time

The problem under study is the Minimum Broadcast Time (MBT). We are given a simple graph and a singleton that owns a message. The goal is to disseminate the message as soon as possible, where the communication takes place between neighboring-nodes in a selective fashion and each forwarding takes one...

Full description

Bibliographic Details
Main Author: Sousa, Amaro de (author)
Other Authors: Gallo, Gabriela (author), Gutierrez, Santiago (author), Robledo, Franco (author), Rodríguez-Bocca, Pablo (author), Romero, Pablo (author)
Format: article
Language:eng
Published: 2022
Subjects:
Minimum Broadcast Time
Computational complexity
Heuristics
Online Access:http://hdl.handle.net/10773/33357
Country:Portugal
Oai:oai:ria.ua.pt:10773/33357

Internet

http://hdl.handle.net/10773/33357

Similar Items