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...

ver descrição completa

Detalhes bibliográficos
Autor principal: Sousa, Amaro de (author)
Outros Autores: Gallo, Gabriela (author), Gutierrez, Santiago (author), Robledo, Franco (author), Rodríguez-Bocca, Pablo (author), Romero, Pablo (author)
Formato: article
Idioma:eng
Publicado em: 2022
Assuntos:
Minimum Broadcast Time
Computational complexity
Heuristics
Texto completo:http://hdl.handle.net/10773/33357
País:Portugal
Oai:oai:ria.ua.pt:10773/33357

Texto Completo

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

Registos relacionados