NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 194-202

  Erlebach, Thomas ^a   Hall, Alexander ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST ACCOUNTING; COSTS; HARDNESS; SCHEDULING;

BI-CRITERIA; BROADCAST SCHEDULING; EDGE CAPACITY; INAPPROXIMABILITY; MAXIMUM DEMAND; NP-HARDNESS; OPTIMAL SOLUTIONS; SINGLE SOURCE;

APPROXIMATION ALGORITHMS;

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

References (12)

1. S. Acharya, S. Muthukrishnan. Scheduling on-demand broadcasts: new metrics and algorithms, in Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobi-com), 1998, pp. 43-54.
2. A. Bar-Noy, R. Bhatia, J. Naor, B. Schieber. Minimizing service and operation costs of periodic scheduling, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, pp. 11-20.
3. Y. Bartal, S. Muthukrishnan. Minimizing Maximum Response Time in Scheduling Broadcasts, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 558-559.
4. Y. Dinitz, N. Garg, M. Goemans. On the single source unsplittable flow problem, Combinatorica, 19 (1999), pp. 1-25.
5. J. Edmonds, K. Prubs. Broadcast Scheduling: When Fairness is Fine, in these proceedings.
6. B. Kalyanasundaram, K. Pruhs. Speed is as powerful as clairvoyance, Journal of the ACM, 47 (2000), pp. 617-643.
7. B. Kalyanasundaram, K. Pruhs, M. Velauthapillai. Scheduling Broadcasts in Wireless Networks, in Proceedings of the 8th Annual European Symposium on Algorithms (ESA), 2000, pp. 290-301, Springer LNCS 1879.
8. C. Kenyon, N. Schabanel. The data broadcast problem with non-uniform transmission times, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 547-556.
9. C. Kenyon, N. Schabanel, N. Young. Polynomial-Time Approximation Scheme for Data Broadcast, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 659-666.
10. C. Phillips, C. Stein, E. Torng, J. Wein. Optimal time-critical scheduling via resource augmentation, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), 1997, pp. 140-149.
11. N. Schabanel. The data broadcast problem with preemption, in Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science (STACS), 2000, pp. 181-192, Springer LNCS 1770.
12. M. Skutella. Approximating the single source unsplittable min-cost flow problem, in Mathematical Programming B (to appear). Extended abstract in the proceedings of FOCS, 2000, pp. 136-145.