Approximation Algorithms for Extensible Bin Packing

Authors:
E. G. Coffman, Jr.;George S. Lueker
Affiliations:
Electrical Engineering Department, Columbia University, New York 10027;Computer Science Department, Donald Bren School of Information and Computer Sciences, University of California, Irvine 92697-3435
Venue:
Journal of Scheduling
Year:
2006

Citing 6
Cited 1

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
Approximation algorithms for extensible bin packing

SODA '01 Proceedings of the twelfth 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

Maximizing data locality in distributed systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a variation of bin packing called extensible bin packing, the number of bins 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 1 if it is not extended, and the size if it is extended. The goal is to pack a set of items of given sizes into the specified number of bins so as to minimize the total cost. Adapting ideas Grötschel et al. (1981), Grötschel et al. (1988), Karmarkar and Karp (1982), Murgolo (1987), we give a fully polynomial time asymptotic approximation scheme (FPTAAS) for extensible bin packing. We close with comments on the complexity of obtaining stronger results.