Approximation algorithms for extensible bin packing

Journal of Scheduling

Volumn 9, Issue 1, 2006, Pages 63-69

  Coffman Jr , E G ^a   Lueker, George S ^b  

^a Department of Earth and Environmental Sciences   (United States)

^b Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING; FULLY POLYNOMIAL TIME ASYMPTOTIC APPROXIMATION SCHEME (FPTAAS); UNIT CAPACITY;

APPROXIMATION THEORY; ASYMPTOTIC STABILITY; COSTS; OPTIMIZATION; PACKING;

BINS;

COSTS; OPTIMIZATION;

EID: 30344436658     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-006-5594-5     Document Type: Review

References (10)

1. Alon, N., Y. Azar, G. J. Woeginger, and T. Yadid, "Approximation schemes for scheduling on parallel machines," Journal of Scheduling, 1, 55-66 (1998).
2. Coffman, Jr., E. G. and G. S. Lueker, "Approximation algorithms for extensible bin packing," in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 586-588.
3. Dell'Olmo, P., H. Kellerer, M. G. Speranza, and Z. Tuza, "A 13/12 approximation algorithm for bin packing with extendable bins," Information Processing Letters, 65, 229-233 (1998).
4. Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
5. Grötschel M., L. Lovász, and A. Schrijver, "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica, 1(2), 169-197 (1981).
6. Grötschel, M., L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics 2. Springer-Verlag, 1988.
7. Hochbaum, D. S. and D. B. Shmoys, "Using dual approximation algorithms for scheduling problems: Theoretical and practical results," journal of the ACM, 34(1), 144-162 (1987).
8. Karmarkar, N. and R. M. Karp, "An efficient approximation scheme for the one-dimensional bin-packing problem," in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982, pp. 312-320.
9. Murgolo, F. D., "An efficient approximation scheme for variable-sized bin packing," SIAM Journal on Computing, 16(1), 149-161, (1987).
10. Woeginger, G. J., "When does a dynamic programming formulation guarantee the existence of an FPTAS," in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999, pp. 820-829.