Approximating the average response time in broadcast scheduling

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 215-221

  Bansal, Nikhil ^a   Charikar, Moses ^b   Khanna, Sanjeev ^c   Naor, Joseph ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b Princeton University   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BROADCAST SCHEDULING; DATA BROADCASTING SYSTEMS; NON-TRIVIAL;

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; SCHEDULING; SERVERS; VIRTUAL REALITY;

BROADCASTING;

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

References (10)

1. N. Alon, and J. Spencer, The Probabilistic Method. John Wiley & Sons, 2000.
2. Y. Bartal and S. Muthukrishnan. Minimizing maximum response time in scheduling broadcasts. Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 558-559, 2000.
3. M. Bellare and J. Rompel. Randomness-Efficient Oblivious Sampling. Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 276-287, 1994.
4. J. Edmonds and K. Pruhs. Broadcast scheduling: when fairness is fine. Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 421-430, 2002.
5. J. Edmonds and K. Pruhs. A maiden analysis of Longest Wait First. Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 818-827, 2004.
6. T. Erlebach and A. Hall. NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 194-202, 2002.
7. R. Gandhi, S. Khuller, Y. Kim and Y-C. Wan. Approximation algorithms for minimizing response time in broadcast scheduling. Proc. of the 9th Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 425-438, 2002.
8. R. Gandhi, S. Khuller, S. Parthasarathy and A. Srinivasan. Dependent Rounding on Bipartite Graphs. Proc. of 43rd IEEE Conference on Foundations of Computer Science (FOCS), pp. 323-332, 2002.
9. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, Scheduling broadcasts in wireless networks, Proc. of the 8th Annual European Symposium on Algorithms, pp. 290-301, 2000.
10. K. Pruhs, J. Sgall, E. Torng, Online Scheduling. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, editor Joseph Y-T. Leung, CRC Press, 2004.