NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow
暂无分享,去创建一个
[1] Nicolas Schabanel. The Data Broadcast Problem with Preemption , 2000, STACS.
[2] Claire Mathieu,et al. Polynomial-time approximation scheme for data broadcast , 2000, STOC '00.
[3] Michel X. Goemans,et al. On the Single-Source Unsplittable Flow Problem , 1999, Comb..
[4] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.
[5] Jon M. Kleinberg,et al. Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.
[7] Rudolf Ahlswede,et al. A Pushing-Pulling Method: New Proofs of Intersection Theorems , 1999, Comb..
[8] Bala Kalyanasundaram,et al. Scheduling Broadcasts in Wireless Networks , 2000, ESA.
[9] Claire Mathieu,et al. The Data Broadcast Problem with Non-Uniform Transmission Times , 1999, SODA '99.
[10] Martin Skutella. Approximating the single source unsplittable min-cost flow problem , 2002, Math. Program..
[11] Kirk Pruhs,et al. Broadcast scheduling: when fairness is fine , 2002, SODA '02.
[12] S. Muthukrishnan,et al. Scheduling on-demand broadcasts: new metrics and algorithms , 1998, MobiCom '98.
[13] S. Muthukrishnan,et al. Minimizing maximum response time in scheduling broadcasts , 2000, SODA '00.
[14] Rajiv Gandhi,et al. Algorithms for Minimizing Response Time in Broadcast Scheduling , 2002, IPCO.
[15] Bala Kalyanasundaram,et al. Speed is as powerful as clairvoyance , 2000, JACM.
[16] Kirk Pruhs,et al. A Comparison of Multicast Pull Models , 2002, ESA.
[17] Randeep Bhatia,et al. Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.