Abstract
In a variation of bin packing called extensible bin packing, the number of bins to use is specified as part of the input, and bins may be extended to hold more than the usual unit capacity. The cost of a bin is one if it is not extended, and the size if it is extended. The goal is to pack a set of items of given sizes with minimum cost. Adapting ideas in [7, 8, ?], we give a fully polynomial asymptotic approximation scheme (FPTAAS) for extensible bin packing. We note that under a different scaling the problem could not admit an FPTAAS unless P = NP.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call