1. Bansal N, Charikar M, Khanna S, Naor J (2005) Approximating the average response time in broadcast scheduling. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, Vancouver
2. Bansal N, Charikar M, Krishnaswamy R, Li S (2014) Better algorithms and hardness for broadcast scheduling via a discrepancy approach. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, Portland
3. Bansal N, Coppersmith D, Sviridenko M (2008) Improved approximation algorithms for broadcast scheduling. SIAM J Comput 38(3): 1157–1174
4. Bansal N, Krishnaswamy R, Nagarajan V (2010) Better scalable algorithms for broadcast scheduling. In: Automata, languages and programming (ICALP), Bordeaux, pp 324–335
5. Erlebach T, Hall A (2002) NP-hardness of broadcast scheduling and inapproximability of singlesource unsplittable min-cost flow. In: Proceedings of the 13th ACM-SIAM symposium on discrete algorithms, San Francisco, pp 194–202