Optimal Linear Broadcast

DOI10.1006/JAGM.1993.1015MaRDI QIDQ4033770zbMATH OpenOpenAlexFDO

Authors Sara Bitan, Shmuel Zaks

Publication date 16 May 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/84b3cc79c7987fff6377883da5b4252cfed9efb9

zbMATH Keywords

high-speed networkslinear broadcastoptimal broadcast routingswitching hardwaretree network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4090796
• Line broadcasting in cycles
• Broadcast networks with near optimal cost
• Minimal-Time k-Line Broadcasting
• An optimal algorithm for broadcasting multiple messages in trees

Cited in

(8)

• Optimal point-to-point broadcast algorithms via lopsided trees
• Minimum-cost line broadcast in paths
• Optimal serial broadcast of successive chunks
• Binary linear programming models for robust broadcasting in communication networks
• scientific article; zbMATH DE number 3884101 (Why is no real title available?)
• scientific article; zbMATH DE number 4090796 (Why is no real title available?)
• Token transfer in a faulty network
• Efficient line broadcasting in a \(d\)-dimensional grid

This page was built for publication: Optimal Linear Broadcast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033770)