Author:
Bansal Nikhil,Nagarajan Viswanath
Publisher
Springer International Publishing
Reference25 articles.
1. N. Bansal, Constructive algorithms for discrepancy minimization, in Foundations of Computer Science (FOCS), 2010, pp. 3–10
2. N. Bansal, M. Charikar, R. Krishnaswamy, S. Li, Better algorithms and hardness for broadcast scheduling via a discrepancy approach, in SODA, 2014, pp, 55–71
3. N. Bansal, R. Khandekar, J. Könemann, V. Nagarajan, B. Peis, On generalizations of network design problems with degree bounds. Math. Program. 141(1–2), 479–506 (2013)
4. J. Beck, T. Fiala, Integer-making theorems. Discret. Appl. Math. 3, 1–8 (1981)
5. M. Charikar, A. Newman, A. Nikolov, Tight hardness results for minimizing discrepancy, in SODA, 2011, pp. 1607–1614
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献