Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference4 articles.
1. T. Erlebach, A. Hall, NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow, in: Proceedings of 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 194–202.
2. R. Gandhi, S. Khuller, Y. Kim, Y-C. Wan, Algorithms for minimizing response time in broadcast scheduling, in: Ninth Integer Programming and Combinatorial Optimization Conference, Lecture Notes in Computer Science, Vol. 2337, Springer, Cambridge, MA, 2002, pp. 425–438.
3. B. Kalyanasundaram, K. Pruhs, M. Velauthapillai, Scheduling broadcasts in wireless networks, in: European Symposium of Algorithms, Lecture Notes in Computer Science, Vol. 1879, Springer, Saarbrücken, Germany, 2000, pp. 290–301.
4. N. Young, Sequential and parallel algorithms for mixed packing and covering, in: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, pp. 538–546.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Broadcast scheduling;ACM Transactions on Algorithms;2011-09
2. Improved Approximation Algorithms for Broadcast Scheduling;SIAM Journal on Computing;2008-01
3. Improved approximation algorithms for broadcast scheduling;Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06;2006