Abstract
We consider the performance of standard bin packing algorithms in the random order model. We provide an improved lower bound of 1.15582656 on the asymptotic approximation ratio of Best Fit (BF) for randomly ordered inputs. We also show lower bounds on the asymptotic approximation ratio for two bounded space bin packing algorithms in this model, namely for 2-BF and 2-FF. These are well-studied bounded space algorithms and the first one has the same asymptotic worst-case performance as BF. However, the resulting lower bounds on their performances in the random order model are much higher than that of BF.
| Original language | English |
|---|---|
| Title of host publication | 19th International Symposium on Algorithms and Data Structures, WADS 2025 |
| Editors | Pat Morin, Eunjin Oh |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (Electronic) | 9783959773980 |
| DOIs | |
| State | Published - 29 Aug 2025 |
| Event | 19th International Symposium on Algorithms and Data Structures, WADS 2025 - Toronto, Canada Duration: 11 Aug 2025 → 15 Aug 2025 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 349 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 19th International Symposium on Algorithms and Data Structures, WADS 2025 |
|---|---|
| Country/Territory | Canada |
| City | Toronto |
| Period | 11/08/25 → 15/08/25 |
Bibliographical note
Publisher Copyright:© Leah Epstein and Asaf Levin.
Keywords
- Best Fit
- Bin packing
- Bounded space algorithms
- Random order
ASJC Scopus subject areas
- Software