Broadcast scheduling: When fairness is fine

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 421-430

  Edmonds, Jeff ^a   Pruhs, Kirk ^b  

^a YORK UNIVERSITY   (Canada)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SCHEDULING;

BROADCAST COMMUNICATION; BROADCAST SCHEDULING; CLIENT-SERVER SYSTEMS; DATA ITEMS; ON-LINE ALGORITHMS; SERVER SCHEDULING;

APPROXIMATION ALGORITHMS;

EID: 84968747434     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. S. Aacharya, and S. Muthukrishnan, "Scheduling on-demand broadcasts: new metrics and algorithms", ACM/IEEE International Conference on Mobile Computing and Networking, 1998.
2. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber, ''Minimizing service and operation costs of periodic scheduling'', 11-20, SODA 1998.
3. Y. Bartal, and S. Muthukrishnan, "Minimizing maximum response time in scheduling broadcasts", 558-559, SODA, 2000.
4. L. Bucchetti, S. Leonardi, A. Marchetti-Spaccanela, and K. Pruhs, "Online weighted flow time and deadline scheduling", manuscript.
5. DirecPC website, http://www.direcpc.com.
6. T. Erlebach and A. Hall, "NP-hardness of broadcast scheduling and inapproximatability of of single-source unsplittable min-cost flow", SODA 2002.
7. J. Edmonds, "Scheduling in the dark", STOC 1999 and Blum's Special Issue of the Journal of Theoretic Computer Science, 1999, and Proc. 31st Ann. ACM Symp. on Theory of Computing.
8. B. Kaiyanasundaram, and K. Pruhs, "Speed is as powerful as clairvoyance", JACM, 2000.
9. B. Kalyanasundaram, K. Pruhs, and M. Velauthapil-lai, "Scheduling broadcasts in wireless networks", European Symposium on Algorithms (ESA), 2000.
10. C. Kenyon, N. Schabanel and N. Young, "Polynomial-time approximation schemes for data broadcast", 659-666, STOC 2000.
11. C. Phillips, C. Stein, E. Torng, and J. Wein "Optimal time-critical scheduling via resource augmentation", ACM Symposium on Theory of Computing, 140-149, 1997.
12. K. Pruhs and P. Uthaisombut, manuscript.