Author:
Chekuri Chandra,Gal Avigdor,Im Sungjin,Khuller Samir,Li Jian,McCutchen Richard,Moseley Benjamin,Raschid Louiqa
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Bansal, N., Coppersmith, D., Sviridenko, M.: Improved approximation algorithms for broadcast scheduling. In: SODA, pp. 344–353 (2006)
2. Bartal, Y., Muthukrishnan, S.: Minimizing maximum response time inscheduling broadcasts. In: SODA, pp. 558–559 (2000)
3. Calinescu, G., Chekuri, C., Pal, M., Vondrak, J.: Maximizing a monotone submodular set function subject to a matroid constraint. SIAM J. on Computing (to appear)
4. Lecture Notes in Computer Science;W. Chan,2004
5. Carney, D., Lee, S., Zdonik, S.: Scalable Application-Aware Data Freshening. In: ICDE, pp. 481–492 (2003)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Batching Task Scheduling;2022 IEEE Real-Time Systems Symposium (RTSS);2022-12
2. Downlink Transmission Scheduling With Data Sharing;IEEE/ACM Transactions on Networking;2022-06
3. Minimizing the maximum flow time in batch scheduling;Operations Research Letters;2016-11
4. A segmentation approach for file broadcast scheduling;Journal of Parallel and Distributed Computing;2013-10