Improved on-line broadcast scheduling with deadlines
暂无分享,去创建一个
Feifeng Zheng | Prudence W. H. Wong | Francis Y. L. Chin | Chung Keung Poon | Wun-Tat Chan | Stanley P. Y. Fung
[1] Jae-Hoon Kim,et al. Scheduling Broadcasts with Deadlines , 2003, COCOON.
[2] Michael J. Franklin,et al. Scheduling for large-scale on-demand data broadcasting , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[3] Thomas Erlebach,et al. NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow , 2002, SODA '02.
[4] Yin-Feng Xu,et al. A tight lower bound for job scheduling with cancellation , 2006, Inf. Process. Lett..
[5] Nitin H. Vaidya,et al. Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.
[6] S. Muthukrishnan,et al. Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.
[7] Bala Kalyanasundaram,et al. On-Demand Broadcasting Under Deadline , 2003, ESA.
[8] Bala Kalyanasundaram,et al. Scheduling Broadcasts in Wireless Networks , 2000, ESA.
[9] Kirk Pruhs,et al. Broadcast scheduling: when fairness is fine , 2002, SODA '02.
[10] Rajiv Gandhi,et al. Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, IPCO.
[11] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[12] Thomas Erlebach,et al. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow , 2001 .
[13] Gerhard J. Woeginger,et al. On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..
[14] Prudence W. H. Wong,et al. New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation , 2004, COCOON.
[15] Francis Y. L. Chin,et al. Laxity Helps in Broadcast Scheduling , 2005, ICTCS.