The broadcast median problem in heterogeneous postal model
From MaRDI portal
Publication:1956241
DOI10.1007/s10878-012-9493-8zbMath1273.90232OpenAlexW1999495699MaRDI QIDQ1956241
Gen-Huey Chen, Ching-Chi Lin, Cheng-Hsiao Tsou, Hung Yu
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9493-8
Related Items (1)
Cites Work
- Broadcasting in heterogeneous networks
- Set to set broadcasting in communication networks
- Generalizations of broadcasting and gossiping
- Broadcasting in Heterogeneous Tree Networks
- A survey of gossiping and broadcasting in communication networks
- Broadcast Time in Communication Networks
- Information Dissemination in Trees
- Designing broadcasting algorithms in the postal model for message-passing systems
- Multiple message broadcasting in the postal model
- Message Multicasting in Heterogeneous Networks
- Reducibility among Combinatorial Problems
- Information dissemination in trees with nonuniform edge transmission times
- On generalized gossiping and broadcasting
This page was built for publication: The broadcast median problem in heterogeneous postal model