A New and Improved Algorithm for Online Bin Packing
We revisit the classic online bin packing problem studied in the half-century. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called bins of total sizes no larger than 1, such that every item is assigned to a bin before the next item is p...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Könyv része |
| Megjelent: |
Leibniz-Zentrum für Informatik
Schloss Dagstuhl
2018
|
| Sorozat: | 26th Annual European Symposium on Algorithms (ESA 2018)
|
| Tárgyszavak: | |
| doi: | 10.4230/LIPIcs.ESA.2018.5 |
| mtmt: | 3407860 |
| Online Access: | http://publicatio.bibl.u-szeged.hu/28447 |
| LEADER | 03066naa a2200265 i 4500 | ||
|---|---|---|---|
| 001 | publ28447 | ||
| 005 | 20231017143857.0 | ||
| 008 | 231017s2018 hu o 0|| Angol d | ||
| 020 | |a 9783959770811 | ||
| 024 | 7 | |a 10.4230/LIPIcs.ESA.2018.5 |2 doi | |
| 024 | 7 | |a 3407860 |2 mtmt | |
| 040 | |a SZTE Publicatio Repozitórium |b hun | ||
| 041 | |a Angol | ||
| 100 | 1 | |a Balogh János | |
| 245 | 1 | 2 | |a A New and Improved Algorithm for Online Bin Packing |h [elektronikus dokumentum] / |c Balogh János |
| 260 | |a Leibniz-Zentrum für Informatik |b Schloss Dagstuhl |c 2018 | ||
| 300 | |a 14 | ||
| 490 | 0 | |a 26th Annual European Symposium on Algorithms (ESA 2018) | |
| 520 | 3 | |a We revisit the classic online bin packing problem studied in the half-century. In this problem, items of positive sizes no larger than 1 are presented one by one to be packed into subsets called bins of total sizes no larger than 1, such that every item is assigned to a bin before the next item is presented. We use online partitioning of items into classes based on sizes, as in previous work, but we also apply a new method where items of one class can be packed into more than two types of bins, where a bin type is defined according to the number of such items grouped together. Additionally, we allow the smallest class of items to be packed in multiple kinds of bins, and not only into their own bins. We combine this with the approach of packing of sufficiently big items according to their exact sizes. Finally, we simplify the analysis of such algorithms, allowing the analysis to be based on the most standard weight functions. This simplified analysis allows us to study the algorithm which we defined based on all these ideas. This leads us to the design and analysis of the first algorithm of asymptotic competitive ratio strictly below 1.58, specifically, we break this barrier by providing an algorithm AH (Advanced Harmonic) whose asymptotic competitive ratio does not exceed 1.57829. Our main contribution is the introduction of the simple analysis based on weight function to analyze the state of the art online algorithms for the classic online bin packing problem. The previously used analytic tool named weight system was too complicated for the community in this area to adjust it for other problems and other algorithmic tools that are needed in order to improve the current best algorithms. We show that the weight system based analysis is not needed for the analysis of the current algorithms for the classic online bin packing problem. The importance of a simple analysis is demonstrated by analyzing several new features together with all existing techniques, and by proving a better competitive ratio than the previously best one. © Janos Balogh, Jozsef Bekesi, Gyorgy Dosa, Leah Epstein, and Asaf Levin. | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 700 | 0 | 1 | |a Békési József |e aut |
| 700 | 0 | 1 | |a Dósa György |e aut |
| 700 | 0 | 1 | |a Epstein Leah |e aut |
| 700 | 0 | 1 | |a Levin Asaf |e aut |
| 856 | 4 | 0 | |u http://publicatio.bibl.u-szeged.hu/28447/1/LIPIcs-ESA-2018-5.pdf |z Dokumentum-elérés |