Broadcast scheduling: Algorithms and complexity

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 473-482

  Chang, Jessica ^a   Erlebach, Thomas ^b   Gailis, Renars ^c   Khuller, Samir ^d  

^a University of Washington   (United States)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c UNIVERSITY OF MARYLAND   (United States)

^d University of Maryland   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS AND COMPLEXITY; BROADCAST SCHEDULING; CLIENT REQUESTS; MULTIPLE CLIENTS; NP COMPLETE; NP COMPLETENESS; RELEASE TIME; RESPONSE TIME; RESPONSE TIMES;

ALGORITHMS; INFORMATION DISSEMINATION; SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

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

References (21)

1. S. Acharya, M. Franklin, and S. Zdonik. Dissemination-based data delivery using broadcast disks. In IEEE Personal Communications, 2(6):50-60, 1995.
2. D. Aksoy, and M. Franklin. RxW: A scheduling approach for large-scale on-demand data broadcast. In IEEE/ACM Transactions On Networking, Volume 7, Number 6, 846-860, 1999.
3. N. Bansal, M. Charikar, S. Khanna, and J. Naor. Approximating the average response time in broadcast scheduling. In Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 215-221, 2005.
4. N. Bansal, D. Coppersmith, and M. Sviridenko. Improved approximation algorithms for broadcast scheduling. In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 344-353, 2006.
5. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber. Minimizing service and operation costs of periodic scheduling. In Proceedings of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 11-20, 1998.
6. A. Bar-Noy, S. Guha, Y. Katz, J. Naor, B. Schieber and H. Schachnai. Throughput Maximization of Real-Time Scheduling with Batching, in Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 742-751, 2002.
7. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 558-559, 2000.
8. W. Chan, T. Lam, H. Ting, and P. Wong. New results on on-demand broadcasting with deadline via job scheduling with cancellation. In 10th COCOON, LNCS 3106, Springer-Verlag, 210-218, 2004.
9. M. Charikar, S. Khuller. A robust maximum completion time measure for scheduling Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 324-333, 2006.
10. M. Chrobak, C. Durr, W. Jawor, L. Kowalik, M. Kurowski. A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, Vol 9(1):71-73 (2006).
11. J. Edmonds and K. Pruhs. Multicast pull scheduling: when fairness is fine. In Proc. of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 421-430, 2002.
12. J. Edmonds and K. Pruhs. A maiden analysis of longest wait first. In Proc. of 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 811-820, 2004.
13. T. Erlebach, 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, 194-202, 2002.
14. R. Gandhi, S. Khuller, Y. Kim, and Y.C. Wan. Algorithms for minimizing response time in broadcast scheduling. In Proc. Ninth Conference on Integer Programming and Combinatorial Optimization (May 2002), vol. 2337 of Lecture Notes in Computer Science, Springer, pp. 415-424.
15. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding in bipartite graphs. In Proc. IEEE Symposium on Foundations of Computer Science (2002), pp. 323-332.
16. R. Gandhi, S. Khuller, S. Parthasarathy, and A. Srinivasan. Dependent rounding and its applications to approximation algorithms. Journal of the ACM Vol 53(3):324-360, (2006).
17. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In European Symposium of Algorithms, LNCS 1879, Springer-Verlag, 290-301, 2000.
18. S. Khuller and Y. Kim. Equivalence of two linear programming relaxations for broadcast scheduling, Operations Research Letters, Vol 32 (5): 473-478 (2004).
19. J. Kim and K. Chwa. Scheduling broadcasts with deadlines. Theoretical Computer Science, Vol 325(3):479-488 (2004).
20. J. Wong. Broadcast Delivery. In Proc. of the IEEE, 76(12):1566-1577, 1988.
21. F. Zheng, S. Fung, W. Chan, F. Chin, C. Poon and P. Wong. Improved online broadcast scheduling with deadlines. Proc. of the 11th International Computing and Combinatorics Conference (CO-COON), pp. 320-329, (2006).