Abstract
We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.
| Original language | English |
|---|---|
| Title of host publication | Approximation and Online Algorithms - 15th International Workshop, WAOA 2017, Revised Selected Papers |
| Editors | Roberto Solis-Oba, Rudolf Fleischer |
| Publisher | Springer Verlag |
| Pages | 102-117 |
| Number of pages | 16 |
| ISBN (Print) | 9783319894409 |
| DOIs | |
| State | Published - 2018 |
| Event | 15th Workshop on Approximation and Online Algorithms, WAOA 2017 - Vienna, Austria Duration: 7 Sep 2017 → 8 Sep 2017 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 10787 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 15th Workshop on Approximation and Online Algorithms, WAOA 2017 |
|---|---|
| Country/Territory | Austria |
| City | Vienna |
| Period | 7/09/17 → 8/09/17 |
Bibliographical note
Funding Information:Gy. Dósa was supported by VKSZ 12-1-2013-0088 “Development of cloud based smart IT solutions by IBM Hungary in cooperation with the University of Pannonia” and by National Research, Development and Innovation Office – NKFIH under the grant SNN 116095. L. Epstein and A. Levin were partially supported by a grant from GIF - the German-Israeli Foundation for Scientific Research and Development (grant number I-1366-407.6/2016).
Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)