Algorithms for minimizing response time in broadcast scheduling

Algorithmica (New York)

Volumn 38, Issue 4, 2004, Pages 597-608

  Gandhi, Rajiv ^a   Khuller, Samir ^b   Kim, Yoo Ah ^b   Wan, Yung Chun ^b  

^a RUTGERS UNIVERSITY   (United States)

^b University of Maryland ^*  (United States)

Author keywords

Approximation algorithms; Broadcasting; Scheduling

Indexed keywords

APPROXIMATION THEORY; BROADCASTING; COMPUTATIONAL METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING; SERVERS; WIRELESS TELECOMMUNICATION SYSTEMS; WORLD WIDE WEB;

APPROXIMATION ALGORITHMS; BROADCAST SCHEDULING; DATA BROADCASTING METHODS; RESPONSE TIME;

ALGORITHMS;

EID: 21044440288     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1058-x     Document Type: Article

References (21)

1. S. Acharya. "Broadcast Disks": Dissemination-based data management for asymmetric communication environments. Ph.D. Thesis, Brown University, 1998.
2. S. Acharya, M. Franklin, and S. Zdonik. Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, 2(6) (1995), 50-60.
3. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. Broadcast Disks: data management for asymmetric communications environments. In Proc. of ACM SIGMOD International Conference on Management of Data, pp. 199-210, 1995.
4. D. Aksoy. On-demand data broadcast for large-scale and dynamic applications. Ph.D. Thesis, University of Maryland at College Park, 2000.
5. D. Aksoy and M. Franklin. RxW: a scheduling approach for large-scale on-demand data broadcast. IEEE/ACM Transactions on Networking, 7(6) (1999), 486-860.
6. M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. In Performance Evaluation, 5(4) (1985), 235-242.
7. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. In Proc. of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11-20, 1998.
8. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proc. of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 558-559, 2000.
9. R. Bhatia. Approximation algorithms for scheduling problems. Ph.D. Thesis, University of Maryland at College Park, 1998.
10. M. Charikar, S. Guha, É. Tardos, and D. Shmoys. A constant factor approximation for the k-median problem. In Proc. of 31 st Annual ACM Symposium on Theory of Computing, pp. 1-10, 1999.
11. C. Chekuri, S. Khanna and A. Zhu. Algorithms for minimizing weighted flow time. In Proc. of 33rd Annual ACM Symposium on Theory of Computing, pp. 84-93, 2001.
12. T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
13. DirecPC website, http://www.direcpc.com
14. T. Erlebach and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. In Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 194-202, 2002.
15. Intel intercast website, http://www.intercast.com.
16. C. Kenyon, N. Schabanel, and N. Young. Polynomial-time approximation scheme for data broadcast. In Proc. of 32nd Annual ACM Symposium on Theory of Computing, pp. 659-666, 2000.
17. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In Proc. of European Symposium of Algorithms, LNCS 1879, Springer-Verlag, Berlin, pp. 290-301, 2000.
18. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. In Proc. of IEEE Symposium on Foundations of Computation, pp. 214-221, 1995.
19. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
20. R. E. Tarjan, H. Kaplan, and K. Tsioutsiouliklis. Faster kinetic heaps and their use in broadcast scheduling. In Proc. of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 836-844, 2001.
21. J. Wong. Broadcast delivery. In Proc. of the IEEE, 76(12) (1988), 1566-1577.