Abstract
Consider the following problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
J.D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971.
W. Fernandez de la Vega and G.S. Lueker. Bin packing can be solved within 1 + e in linear time. Combinatorica, 1: 349–355, 1981.
N. Karmakar and R.M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In Proc. 23rd IEEE Annual Symposium on Foundations of Computer Science, pages 312–320, 1982.
E.G. Coffman Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin backing: a survey. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46–93. PWS Publishing, Boston, MA, 1997.
H.W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8: 538–548, 1983.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, UK, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Bin Packing. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive