Stolyar, A. L., & Zhong, Y. (2016, September). A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model. 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 319-326. https://doi.org/10.1109/ALLERTON.2016.7852247
Citácia podle Chicago (17th ed.)Stolyar, Alexander L., a Yuan Zhong. "A Greedy Randomized Algorithm Achieving Sublinear Optimality Gap in a Dynamic Packing Model." 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Sep. 2016: 319-326. https://doi.org/10.1109/ALLERTON.2016.7852247.
Citácia podľa MLA (8th ed.)Stolyar, Alexander L., a Yuan Zhong. "A Greedy Randomized Algorithm Achieving Sublinear Optimality Gap in a Dynamic Packing Model." 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Sep. 2016, pp. 319-326, https://doi.org/10.1109/ALLERTON.2016.7852247.