Message Multicasting in Heterogeneous Networks

DOI10.1137/S0097539798347906zbMath0963.68079OpenAlexW1991192327MaRDI QIDQ4507354

Amotz Bar-Noy, Joseph (Seffi) Naor, Sudipto Guha, Baruch Schieber

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539798347906

zbMATH Keywords

combinatorial optimizationapproximation algorithmsmulticastpostal modelheterogeneous networksLogP model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (12)

Broadcasting a file in a communication network ⋮ On the complexity of the shortest-path broadcast problem ⋮ Radio aggregation scheduling ⋮ The broadcast median problem in heterogeneous postal model ⋮ Connectivity and inference problems for temporal networks ⋮ Efficient broadcast trees for weighted vertices ⋮ Broadcasting on networks of workstations ⋮ Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks ⋮ Sublogarithmic approximation for telephone multicast ⋮ REVISITING MATRIX PRODUCT ON MASTER-WORKER PLATFORMS ⋮ Broadcasting in weighted trees under the postal model ⋮ Improved algorithm for minimum data aggregation time problem in wireless sensor networks

This page was built for publication: Message Multicasting in Heterogeneous Networks