We slightly improve the known lower bound on the asymptotic competitive ratio for online bin packing of rectangles. We present a complete proof for the new lower bound, whose value is above 1.91.
Bibliographical notePublisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
- Competitive ratio
- Online algorithms
- Rectangle packing
ASJC Scopus subject areas
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Control and Optimization
- Computational Theory and Mathematics
- Applied Mathematics