@article {15259,
	title = {Broadcasting on networks of workstations},
	journal = {Algorithmica},
	volume = {57},
	year = {2010},
	month = {2010///},
	pages = {848 - 868},
	abstract = {Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message to a machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C(>=1) time units. The clusters may have arbitrary sizes. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending node does not block for C time units when the message is in transit.},
	doi = {10.1007/s00453-008-9249-0},
	author = {Khuller, Samir and Kim,Y. A and Wan,Y. C.J}
}
