The broadcast median problem in heterogeneous postal model

@article{Tsou2013TheBM,
  title={The broadcast median problem in heterogeneous postal model},
  author={Cheng-Hsiao Tsou and Gen-Huey Chen and Hung-I Yu and Ching-Chi Lin},
  journal={Journal of Combinatorial Optimization},
  year={2013},
  volume={25},
  pages={602-616}
}
We propose the problem of finding broadcast medians in heterogeneous networks. A heterogeneous network is represented by a graph G=(V,E), in which each edge has a weight that denotes the communication time between its two end vertices. The overall delay of a vertex v∈V(G), denoted as b(v,G), is the minimum sum of the communication time required to send a message from v to all vertices in G. The broadcast median problem consists of finding the set of vertices v∈V(G) with minimum overall delay b… CONTINUE READING

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper