On-demand broadcasting under deadline

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

Volumn 2832, Issue , 2003, Pages 313-324

  Kalyanasundaram, Bala ^a   Velauthapillai, Mahe ^a  

^a GEORGETOWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BROADCAST CHANNELS; BROADCAST SCHEDULING; MULTIPLE USER; ON-DEMAND BROADCAST; ON-LINE ALGORITHMS; REAL - TIME SCHEDULING; SCHEDULING SYSTEMS; UPPER BOUND;

SCHEDULING;

EID: 0142183802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_30     Document Type: Article

References (12)

1. A. Aacharya and S. Muthukrishnan. Scheduling On-demand Broadcasts: New Metrics and Algorithms. In MobiCom, 1998.
2. A. Bar-Noy, S. Guha, y. Katz, and J. Naor. Throughput maximization of real-time scheduling with batching. In Proceedings of ACM/SIAM Symposium on Discrete Algorithms, January 2002.
3. Y. Bartal and S. Muthukrishnan. Minimizing Maximum Response Time in Scheduling Broadcasts. In SODA, pages 558-559, 2000.
4. J. Edmonds and K. Pruhs. Multicast pull scheduling: When fairness is fine. In Proceedings of ACM/SIAM Symposium on Discrete Algorithms, January 2002.
5. T. Erlebach and A. Hall. Np-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proceedings of ACM/SIAM Symposium on Discrete Algorithms, January 2002.
6. R. Gandhi, S. Khuller, Y. Kim, and Y-C Wan. Approximation algorithms for broadcast scheduling. In Proceedings of Conference on Integer Programming and Combinatorial Optimization, 2002.
7. R. Gandhi, S. Khuller, S. Parthasarathy, and S. Srinivasan. Dependent rounding in bipartite graphs. IEEE Symposium on Foundations of Computer Science, 2002.
8. B. Kalyanasundaram and K.R. Pruhs. Speed is as Powerful as Clairvoyance. IEEE Symposium on Foundation of Computation, pages 214-221, 1995.
9. B. Kalyanasundaram, K.R. Pruhs, and M. Velauthapillai. Scheduling Broadcasts in Wireless Networks. Journal of Scheduling, 4:339-354, 2001.
10. C. Kenyon, N. Schabanel, and N Young. Polynomial-time approximation schemes for data broadcasts. In Proceedings of Symposium on Theory of Computing, pages 659-666, 2000.
11. J. H. Kim and K. Y. Chowa. Scheduling broadcasts with deadlines. In COCOON, 2003.
12. C. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In ACM Symposium on Theory of Computing, pages 140-149, 1997.