Scheduling broadcasts in wireless networks

Journal of Scheduling

Volumn 4, Issue 6, 2001, Pages 339-354

  Kalyanasundaram, Bala ^a   Pruhs, Kirk R ^b   Velauthapillai, Mahendran ^a  

^a GEORGETOWN UNIVERSITY   (United States)

^b University of Pittsburgh   (United States)

Author keywords

Approximation algorithm; Broadcast scheduling; Extra resource analysis; Online algorithm

Indexed keywords

EID: 0346491914     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.87     Document Type: Article

References (11)

1. Intel Intercast website, http://www.intercast.com.
2. DirecPC website, http://www.direcpc.com.
3. Hybrid website, http://www.hybrid.com.
4. AirMedia website, http://www.airmedia.com.
5. Lawler E, Lenstra JK, Rinnooy Kan A, Shmoys D. Sequencing and scheduling: algorithms and complexity. In Logistics of Production and Inventory, Handbooks in OR & MS 4, Graves S, Rinnooy Kan A, Zipkin P (eds.), Chapter 9. Elsevier Science: Amsterdam, 1993; 445-522.
6. Coffman E, Denning P. Operating Systems Theory. Prentice-Hall: Englewood cliffs, NJ, 1973.
7. Kalyanasundaram B, Pruhs K. Speed is a powerful as clairvoyance. IEEE Symposium on Foundations of Computation, 1995; 214-221.
8. Phillips C, Stein C, Torng E, Wein J. Optimal time-critical scheduling via resource augmentation. ACM Symposium on Theory of Computing, 1997; 140-149.
9. Bartal Y, Muthukrishnan S. Minimizing maximum response time in scheduling broadcasts. ACM/SIAM symposium on Discrete Algorithms, 2000; 558-559.
10. Aacharya S, Muthukrishnan S. Scheduling on-demand broadcasts: new metrics and algorithms. ACM/IEEE International Conference on Mobile Computing and Networking, 1998; 43-54.
11. Leonardi S, Raz D. Approximating total flow time on parallel machines. ACM Symposium on Theory of Computing, 1997; 110-119.