Balogh, J., Epstein, L., & Levin, A. (2019). Lower bounds for online bin covering-type problems. Journal of Scheduling, 22(4), 487. https://doi.org/10.1007/s10951-018-0590-0
Chicago Style (17th ed.) CitationBalogh, János, Leah Epstein, and Asaf Levin. "Lower Bounds for Online Bin Covering-type Problems." Journal of Scheduling 22, no. 4 (2019): 487. https://doi.org/10.1007/s10951-018-0590-0.
MLA (9th ed.) CitationBalogh, János, et al. "Lower Bounds for Online Bin Covering-type Problems." Journal of Scheduling, vol. 22, no. 4, 2019, p. 487, https://doi.org/10.1007/s10951-018-0590-0.
Warning: These citations may not always be 100% accurate.