Robust maximum completion time measure for scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 324-333

  Charikar, Moses ^a   Khullert, Samir ^b  

^a Princeton University   (United States)

^b Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROASTCAST SCHEDULING; ONLINE APPROXIMATION;

BROADCASTING; ROBUSTNESS (CONTROL SYSTEMS); SCHEDULING;

ALGORITHMS;

EID: 33244469954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109594     Document Type: Conference Paper

References (23)

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. In IEEE Personal Communications, 2(6), 1995.
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 (SIGMOD), 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. In IEEE/ACM Transactions On Networking, Volume 7, Number 6, 486-860, 1999.
6. M. H. Ammar and J. W. Wong. The design of teletext broadcast cycles. In Performance Evaluation, Vol. 5(4), 235-242, 1985.
7. 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.
8. N. Bansal, D. Coppersmith, and M. Sviridenko. Improved Approximation Algorithms for Broadcast Scheduling. In Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006.
9. A. Bar-Noy, R. Bhatia, J. Naor, and B. Schieber. Minimizing service and operation costs of periodicscheduling. In Proceedings of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 11-20, 1998.
10. 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.
11. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 558-559, 2000.
12. R. Bhatia. Approximation algorithms for scheduling problems. Ph.D. Thesis, University of Maryland at College Park, 1998.
13. M. Charikar, S. Khuller, D. Mount and G. Narasimhan. Algorithms for facility location problems with outliers. In Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 642-651, 2001.
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.
19. 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 659-666, 2000.
20. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai. Scheduling broadcasts in wireless networks. In European Symposium of Algorithms, LNCS 1879, Springer-Verlag, 290-301, 2000.
21. E. Lawler. Combinatorial Optimization. Holt, Rinehart and Winston (1976).
22. J. K. Lenstra, D. Shmoys and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46: 259-271, 1990.
23. J. Wong. Broadcast Delivery. In Proc. of the IEEE, 76(12), 1988.