Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 846-866 |
| Number of pages | 21 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 38 |
| Issue number | 3 |
| DOIs | |
| State | Published - 15 Oct 2019 |
Bibliographical note
Publisher Copyright:© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
Keywords
- 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
Fingerprint
Dive into the research topics of 'A lower bound for online rectangle packing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver