Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty

Article Properties
Cite
Bougeret, Marin, et al. “Constant-Ratio Approximation for Robust Bin Packing With Budgeted Uncertainty”. SIAM Journal on Discrete Mathematics, vol. 36, no. 4, 2022, pp. 2534-52, https://doi.org/10.1137/21m1457199.
Bougeret, M., Dósa, G., Goldberg, N., & Poss, M. (2022). Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM Journal on Discrete Mathematics, 36(4), 2534-2552. https://doi.org/10.1137/21m1457199
Bougeret, Marin, György Dósa, Noam Goldberg, and Michael Poss. “Constant-Ratio Approximation for Robust Bin Packing With Budgeted Uncertainty”. SIAM Journal on Discrete Mathematics 36, no. 4 (2022): 2534-52. https://doi.org/10.1137/21m1457199.
Bougeret M, Dósa G, Goldberg N, Poss M. Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM Journal on Discrete Mathematics. 2022;36(4):2534-52.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
International Workshop on Approximation and Online Algorithms 2019
International Workshop on Approximation and Online Algorithms 2019
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM 2015
International Workshop on Approximation and Online Algorithms, (WAOA 2011 2011
26th European Symposium on Algorithms, Y. Azar, H. Bast, and G. Herman, eds., LIPIcs, Liebniz Int. Proc. Inform. 112 2018