Author:
Chekuri Chandra,Quanrud Kent,Torres Manuel R.
Publisher
Springer International Publishing
Reference18 articles.
1. Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: Solving packing integer programs via randomized rounding with alterations. Theory Comput. 8(24), 533–565 (2012).
https://doi.org/10.4086/toc.2012.v008a024
2. Chan, T.M.: Approximation schemes for 0-1 knapsack. In: 1st Symposium on Simplicity in Algorithms (2018)
3. Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput. 33(4), 837–851 (2004)
4. Chekuri, C., Quanrud, K.: On approximating (sparse) covering integer programs. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1596–1615. SIAM (2019)
5. Chekuri, C., Quanrud, K., Torres, M.R.:
$$\ell _1$$
-sparsity approximation bounds for packing integer programs (2019). arXiv preprint:
arXiv:1902.08698