Author:
Gutin Gregory,Jensen Tommy,Yeo Anders
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference18 articles.
1. D.J. Brown, A lower bound for on-line one-dimensional bin packing algorithms, Technical Report R-864, Coordinated Science Laboratory, Urbana, IL, 1979.
2. Does randomization help in on-line bin packing?;Chandra;Inform. Process. Lett.,1992
3. Bin packing approximation algorithms;Coffman,1999
4. Approximation Algorithms for bin packing;Coffman,1996
5. J. Csirik, G. Woeginger, On-line packing and covering problems, in: A. Fiat, G. Woeginger (Eds.), On-line Algorithms—The State of the Art, Lecture Notes in Computer Science, vol. 1442, Springer, New York, 1998, pp. 147–177.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal Online Bin Packing Algorithms for Some Cases with Two Item Sizes;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-09-01
2. Packing batches of cubes into a single bin;Information Processing Letters;2023-02
3. Several methods of analysis for cardinality constrained bin packing;Theoretical Computer Science;2023-01
4. Open-end bin packing: New and old analysis approaches;Discrete Applied Mathematics;2022-11
5. Batched Graph Community Detection on GPUs;Proceedings of the International Conference on Parallel Architectures and Compilation Techniques;2022-10-08