Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
An efficient approximation scheme for variable-sized bin packing
SIAM Journal on Computing
A 13/12 approximation algorithm for bin packing with extendable bins
Information Processing Letters
When does a dynamic programming formulation guarantee the existence of an FPTAS?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On-line scheduling with extendable working time on a small number of machines
Information Processing Letters
Vector Assignment Problems: A General Framework
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Vector assignment problems: a general framework
Journal of Algorithms
Configuration of distributed message converter systems
Performance Evaluation
Approximation Algorithms for Extensible Bin Packing
Journal of Scheduling
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
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.