A 13/12 approximation algorithm for bin packing with extendable bins

Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza

Research output: Contribution to journalArticle

26 Citations (Scopus)


A set of items has to be assigned to a set of bins with size one. If necessary, the size of the bins can be extended. The objective is to minimize the total size, ie., the sum of the sizes of the bins. The Longest Processing Time-neuristic is applied to this NP-hard problem. For this approximation algorithm we prove a worst-case bound of 13/12 which is shown to be tight when the number of bins is even.

Original languageEnglish
Pages (from-to)229-233
Number of pages5
JournalInformation Processing Letters
Issue number5
Publication statusPublished - Mar 13 1998


  • Approximation algorithms
  • Bin packing
  • Scheduling
  • Worst-case performance

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A 13/12 approximation algorithm for bin packing with extendable bins'. Together they form a unique fingerprint.

  • Cite this