Optimal point-to-point broadcast algorithms via lopsided trees

DOI10.1016/S0166-218X(99)00107-9zbMath1031.90006MaRDI QIDQ1296579

Assaf Schuster, Mordecai J. Golin

Publication date: 18 February 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

networksbroadcast algorithmslopsided

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On searching strategies, parallel questions, and delayed answers

Cites Work

• Unnamed Item
• Unnamed Item
• Recurrence relations based on minimization
• Broadcasting multiple messages in simultaneous send/receive systems
• Optimal computation of census functions in the postal model
• Optimal multiple message broadcasting in telephone-like communication systems
• An Elementary Approach to Some Analytic Asymptotics
• A survey of gossiping and broadcasting in communication networks
• Designing broadcasting algorithms in the postal model for message-passing systems
• Multiple message broadcasting in the postal model
• A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
• Optimum lopsided binary trees

This page was built for publication: Optimal point-to-point broadcast algorithms via lopsided trees