Improved approximation algorithms for broadcast scheduling

SIAM Journal on Computing

Volumn 38, Issue 3, 2008, Pages 1157-1174

  Bansal, Nikhil ^a   Coppersmiths, Don ^b   Sviridenko, Maxim ^a  

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

^b CENTER FOR COMMUNICATIONS RESEARCH   (United States)

Author keywords

Approximation algorithm; Broadcast scheduling; LP rounding

Indexed keywords

APPROXIMATION FACTORS; APPROXIMATION RATIOS; AVERAGE RESPONSE TIMES; BROADCAST SCHEDULING; CHARIKAR; DISCRETE ALGORITHMS; LINEAR PROGRAMMING RELAXATIONS; LINEAR PROGRAMS; LP ROUNDING; NEW YORK; OFFLINE VERSIONS; OPTIMUM VALUES; PHILADELPHIA; RESPONSE TIMES; SCHEDULING POLICIES; SERVER SYSTEMS; SINGLE SERVERS; TIME SLOTS; VANCOUVER , BRITISH COLUMBIA;

ALGORITHMS; LINEAR PROGRAMMING; LINEARIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 55249087205     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060674417     Document Type: Article

References (19)

1. AIRMEDIA WEBSITE, http://www.airmedia.com.
2. N. BANSAL, M. CHARIKAR, S. KHANNA, AND J. NAOR, Approximating the average response time in broadcast scheduling, in Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Vancouver, British Columbia, ACM, New York, SIAM, Philadelphia, 2005, pp. 215-221.
3. A. BAR-NOY, S. GUHA, Y. KATZ, J. NAOR, B. SCHIEBER, AND H. SHACHNAI, Throughput maximization of real-time scheduling with batching, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, SIAM, Philadelphia, 2002, pp. 742-751.
4. Y. BARTAL AND S. MUTHUKRISHNAN, Minimizing maximum response time in scheduling broadcasts, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, SIAM, Philadelphia, 2000, pp. 558-559.
5. A. BLUM, P. CHALASANI, D. COPPERSMITH, W. R. PULLEYBLANK, P. RAGHAVAN, AND M. SUDAN, The minimum latency problem, in Proceedings of the 26th Annual Symposium on Theory of Computing (STOC), Montreal, Quebec, 1994, pp. 163-171.
6. J. CHANG, T. ERLEBACH, R. GAILIS, AND S. KHULLER, Broadcast scheduling: Algorithms and complexity, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, SIAM, Philadelphia, 2008, pp. 473-482.
7. M. CHARIKAR AND S. KHULLER, A robust maximum completion time measure for scheduling, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, ACM, New York, SIAM, Philadelphia, 2006, pp. 324-333.
8. K. CHAUDHURI, B. GODFREY, S. RAO, AND K. TALWAR, Paths, trees, and minimum, latency tours, in Proceedings of the 44th Annual Symposium Foundations of Computer Science (FOCS), Cambridge, MA, 2003, pp. 36-45.
9. B. CHAZELLE, The Discrepancy Method: Randomness and Complexity, 1st ed., Cambridge University Press, Cambridge, 2000.
10. DIRECPC WEBSITE, http://www.direcpc.com.
11. J. EDMONDS AND K. PRUHS, Broadcast scheduling: When fairness is fine, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, SIAM, Philadelphia, 2002, pp. 421-430.
12. J. EDMONDS AND K. PRUHS, A maiden analysis of longest wait first, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, ACM, New York, SIAM, Philadelphia, 2004, pp. 818-827.
13. T. ERLEBACH AND A. HALL, NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, SIAM, Philadelphia, 2002, pp. 194-202.
14. R. GANDHI, S. KHULLER, Y. KIM, AND Y-C. WAN, Approximation algorithms for broadcast scheduling, in Proceedings of the 9th Annual Conference on Integer Programming and Combinatorial Optimization (IPCO), Cambridge, MA, 2002.
15. R. GANDHI, S. KHULLER, S. PARTHASARATHY, AND A. SRINIVASAN, Dependent rounding in bipartite graphs, J. ACM, 53 (2006), pp. 324-360.
16. M. GOEMANS AND J. KLEINBERG, An improved approximation ratio for the minimum latency problem, Math. Programming, 82 (1998), pp. 111-124.
17. B. KALYANASUNDARAM, K. PRUHS, AND M. VELAUTHAPILLAI, Scheduling broadcasts in wireless networks, in Proceedings of the 8th Annual European Symposium on Algorithms, Saarbrucken, Germany, 2000, pp, 290-301.
18. S. KHULLER AND Y. KIM, Equivalence of two linear programming relaxations for broadcast scheduling, Oper. Res. Lett., 32 (2004), pp. 473-478.
19. J. ROBERT AND N. SCHABANEL, Pull-based data broadcast with dependencies: Be fair to users, not to items, in Proceedings of the Eighteenth Annual AGM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, ACM, New York, SIAM, Philadelphia, 2007, pp. 238-247.