Minimizing broadcast costs under edge reductions in tree networks

DOI10.1016/S0166-218X(98)00121-8zbMath0924.68101MaRDI QIDQ1283789

Susanne E. Hambrusch, Hyeong-Seok Lim

Publication date: 30 March 1999

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

zbMATH Keywords

tree networksedge reductions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Methods and problems of communication in usual 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
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Improving spanning trees by upgrading nodes
• Network upgrading problems
• Information dissemination in trees with nonuniform edge transmission times
• Optimum broadcasting and personalized communication in hypercubes

This page was built for publication: Minimizing broadcast costs under edge reductions in tree networks