1. Tight Bounds for Clairvoyant Dynamic Bin Packing
2. Allan Borodin and Ran El-Yaniv. 1998. Online computation and competitive analysis. Allan Borodin and Ran El-Yaniv. 1998. Online computation and competitive analysis.
3. Niv Buchbinder , Yaron Fairstein , Konstantina Mellou , Ishai Menache , and Joseph (Seffi) Naor . 2021 . Online Virtual Machine Allocation with Lifetime and Load Predictions. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems ( Virtual Event, China) (SIGMETRICS '21). Association for Computing Machinery, New York, NY, USA, 9--10. https://doi.org/10.1145/3410220.3456278 10.1145/3410220.3456278 Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, and Joseph (Seffi) Naor. 2021. Online Virtual Machine Allocation with Lifetime and Load Predictions. In Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems (Virtual Event, China) (SIGMETRICS '21). Association for Computing Machinery, New York, NY, USA, 9--10. https://doi.org/10.1145/3410220.3456278
4. Approximation and online algorithms for multidimensional bin packing: A survey
5. Edward G. Coffman Jr ., János Csirik , Gábor Galambos , Silvano Martello , and Daniele Vigo . 2013. Bin Packing Approximation Algorithms: Survey and Classification . Springer New York , New York, NY , 455--531. https://doi.org/10.1007/978-1-4419-7997-1_35 10.1007/978-1-4419-7997-1_35 Edward G. Coffman Jr., János Csirik, Gábor Galambos, Silvano Martello, and Daniele Vigo. 2013. Bin Packing Approximation Algorithms: Survey and Classification. Springer New York, New York, NY, 455--531. https://doi.org/10.1007/978-1-4419-7997-1_35