Paper Info
Title
The Best Two-Phase Algorithm for Bin Stretching.
Abstract
Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1:5 for any number of bins. We build on previous algorithms and use a two-phase approach. We also show that this approach cannot give better results by proving a matching lower bound.
Year
Venue
Field
2016
arXiv: Data Structures and Algorithms
Discrete mathematics,Combinatorics,Bin,Upper and lower bounds,Best bin first,Algorithm,Bin packing problem,Mathematics
DocType
Volume
Citations 
Journal
abs/1601.08111
0
PageRank 
References 
Authors
0.34
6
4
Name
Order
Citations
PageRank
Martin Böhm1296.65
jir sgall219922.48
Rob van Stee300.68
Pavel Veselý4309.05