A tree-block decomposition-based heuristic for the minimum broadcast time

The problem under study is the minimum broadcast time. Given an undirected connected graph and a singleton that owns a message, the goal is to broadcast this message as soon as possible, where the communication takes place between neighbouring-nodes in a selective fashion and each forwarding takes o...

ver descrição completa

Detalhes bibliográficos
Autor principal: Sousa, Amaro de (author)
Outros Autores: Gallo, Gabriela (author), Gutiérrez, Santiago (author), Robledo, Franco (author), Rodríguez-Bocca, Pablo (author), Romero, Pablo (author)
Formato: article
Idioma:eng
Publicado em: 2022
Assuntos:
Minimum broadcast time
MBT
Computational complexity
Integer linear programming
ILP
Heuristics
Texto completo:http://hdl.handle.net/10773/33356
País:Portugal
Oai:oai:ria.ua.pt:10773/33356

Texto Completo

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

Registos relacionados