Affiliation:
1. Tel-Aviv University, Tel-Aviv, Israel
Funder
Israel Science Foundation
Blavatnik Fund
Israeli Centers for Research Excellence
Reference15 articles.
1. New lower bounds for certain classes of bin packing algorithms;Balogh János;Theor. Comput. Sci., 440--,2012
2. Mihai Burcea. Online dynamic bin packing. PhD thesis University of Liverpool UK 2014. Mihai Burcea. Online dynamic bin packing. PhD thesis University of Liverpool UK 2014.
3. On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
4. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. Dynamic Bin Packing with Predictions;ACM SIGMETRICS Performance Evaluation Review;2023-06-26
3. Dynamic Bin Packing with Predictions;Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems;2023-06-19
4. Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis;IEEE Transactions on Parallel and Distributed Systems;2022-12-01
5. Dynamic Bin Packing with Predictions;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2022-12