Skip to main content
SpringerLink
Log in

Bin Packing

  • Chapter
Approximation Algorithms

Abstract

Consider the following problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. J.D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971.

    Google Scholar 

  2. 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.

    Article  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. H.W. Lenstra, Jr. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8: 538–548, 1983.

    Article  MathSciNet  Google Scholar 

  6. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, UK, 1998.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia Institute of Technology, College of Computing, 801 Atlantic Avenue, 30332-0280, Atlanta, GA, USA

    Vijay V. Vazirani

Authors
  1. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation