Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
An Efficient Algorithm for Gossiping in the Multicasting Communication Environment
IEEE Transactions on Parallel and Distributed Systems
Broadcast Trees for Heterogeneous Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
Sublogarithmic approximation for telephone multicast
Journal of Computer and System Sciences
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
IEEE/ACM Transactions on Networking (TON)
The impact of heterogeneity on master-slave scheduling
Parallel Computing
Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Broadcasting in heterogeneous tree networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
The impact of heterogeneity on master-slave on-line scheduling
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Minimum multicast time problem in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Optimal file distribution in peer-to-peer networks
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
In heterogeneous networks, sending messages may incur different delays on different links, and each node may have a different switching time between messages. The well-studied telephone model is obtained when all link delays and switching times are equal to one unit. We investigate the problem of finding the minimum time required to multicast a message from one source to a subset of the nodes of size k. The problem is NP-hard even in the basic telephone model. We present a polynomial-time algorithm that approximates the minimum multicast time within a factor of O(log k). Our algorithm improves on the best known approximation factor for the telephone model by a factor of $O(\frac{\log n}{\log\log k})$. No approximation algorithms were known for the general model considered in this paper.