Scheduling broadcasts with deadlines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2697, Issue , 2003, Pages 415-424

  Kim, Jae Hoon ^a   Chwa, Kyung Yong ^b  

^a Pusan University of Foreign Studies   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248880971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_42     Document Type: Article

References (14)

1. S. Aacharya and S. Muthukrishnan. Scheduling on-demand broadcasts: new metrics and algorithms. In ACM/IEEE International Conference on Mobile Computing and Networking, pages 43-54, 1998.
2. D. Aksoy and M. Franklin. Scheduling for large scale on-demand data broadcast. In Proc. of IEEE INFOCOM, pages 651-659, 1998.
3. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proc. of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 558-559, 2000.
4. J. Edmonds and K. Pruhs. Broadcast scheduling: when fairness is fine. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 421-430, 2002.
5. T. Erlebach and A. Hall. Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 194-202, 2002.
6. R. Gandhi, S. Khuller, Y. A. Kim, and Y. C. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proc. of 9th International Integer Programming and Combinatorial Optimization (IPCO) Conference, volume 2337 of Lecture Notes in Computer Science (LNCS), pages 425-438. Springer-Verlag, 2002.
7. S. Jiang and N. Vaidya. Scheduling data broadcasts to "impatient" users. In Proc. of the ACM International Workshop on Data Engineering for Wireless and Mobile Access, pages 52-59, 1999.
8. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 290-301. Springer-Verlag, 2000.
9. B. Kalyanasundaram and M. Velauthapillai. Broadcast scheduling under deadline. private communication, 2003.
10. R. Lipton and A. Tomkins. Online interval scheduling. In Proc. of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302-311, 1994.
11. DirecPC Home Page, http://www.direcpc.com/.
12. J. Sgall. Online scheduling. In Online Algorithms: The State of the Art, eds. A. Fiat and G. J. Woeginger, volume 1442 of Lecture Notes in Computer Science (LNCS), pages 196-231. Springer-Verlag, 1998.
13. M. van den Akker, H. Hoogeven, and N. Vakhania. Restarts can help in the on-line minimization of the maximum delivery time on a single machine. In Proc. of 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science (LNCS), pages 427-436. Springer-Verlag, 2000.
14. Gerhard J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130:5-16, 1994.