Skip to main content
SpringerLink
Log in

Robust Bin Packing

  • Living reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 223 Accesses

Years and Authors of Summarized Original Work

2009; Epstein, Levin

2013; Jansen, Klein

Problem Definition

Consider the classical online bin packing problem, where items of sizes in (0, 1] arrive over time. At the arrival of each item, it has to be assigned to a bin of capacity 1 such that the total size of all items in the bin does not exceed its capacity. The objective is to minimize the number of used bins.

Online bin packing was introduced by Ullman [10] and has seen enormous research since then (see the survey of Seiden [9] for an overview). The quality of an online algorithm is typically measured by the asymptotic performance guarantee of the algorithm divided by the optimal offline solution and is called the (asymptotic) competitive ratio. In the case of online bin packing, the best known algorithm has an asymptotic competitive ratio of 1. 58889 (see [9]). On the other hand, it was shown that no algorithm can achieve a ratio better than 1. 54037 (see [1]).

To obtain algorithms...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Balogh J, Békési J, Galambos G (2010) New lower bounds for certain classes of bin packing algorithms. In: Workshop on approximation and online algorithms (WAOA), Liverpool. LNCS, vol 6534, pp 25–36

    Google Scholar 

  2. Cook W, Gerards A, Schrijver A, Tardos E (1986) Sensitivity theorems in integer linear programming. Math Program 34(3):251–264

    Article  MATH  MathSciNet  Google Scholar 

  3. Epstein L, Levin A (2009) A robust APTAS for the classical bin packing problem. Math Program 119(1):33–49

    Article  MATH  MathSciNet  Google Scholar 

  4. Epstein L, Levin A (2013) Robust approximation schemes for cube packing. SIAM J Optim 23(2):1310–1343

    Article  MATH  MathSciNet  Google Scholar 

  5. Fernandez de la Vega W, Lueker G (1981) Bin packing can be solved within 1 + ε in linear time. Combinatorica 1(4):349–355

    Article  MATH  MathSciNet  Google Scholar 

  6. Ivković Z, Lloyd E (1998) Fully dynamic algorithms for bin packing: being (mostly) myopic helps. SIAM J Comput 28(2):574–611

    Article  MATH  Google Scholar 

  7. Jansen K, Klein K (2013) A robust AFPTAS for online bin packing with polynomial migration. In: International colloquium on automata, languages, and programming (ICALP), Riga, pp 589–600

    Google Scholar 

  8. Sanders P, Sivadasan N, Skutella M (2009) Online scheduling with bounded migration. Math Oper Res 34(2):481–498

    Article  MATH  MathSciNet  Google Scholar 

  9. Seiden S (2002) On the online bin packing problem. J ACM 49(5):640–671

    Article  MathSciNet  Google Scholar 

  10. Ullman J (1971) The performance of a memory allocation algorithm. Technical report, Princeton University

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University Kiel, Kiel, Germany

    Kim-Manuel Klein

Authors
  1. Kim-Manuel Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kim-Manuel Klein .

Editor information

Editors and Affiliations

  1. Dept. Electrical Engineering & Computer Science, Northwestern University, Evanston, Illinois, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Klein, KM. (2014). Robust Bin Packing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_492-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_492-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation