An O(n) bin-packing algorithm for uniformly distributed data

J. Csirik, G. Galambos

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We give a first-fit type algorithm, with running time O(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm is O(n2/3).

Original languageEnglish
Pages (from-to)313-319
Number of pages7
JournalComputing
Volume36
Issue number4
DOIs
Publication statusPublished - Dec 1986

Fingerprint

Bin Packing
Bins
Bin Packing Problem

Keywords

  • bin-packing heuristic algorithm
  • on-line algorithm
  • One-dimensional packing
  • probabilistic analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

An O(n) bin-packing algorithm for uniformly distributed data. / Csirik, J.; Galambos, G.

In: Computing, Vol. 36, No. 4, 12.1986, p. 313-319.

Research output: Contribution to journalArticle

Csirik, J. ; Galambos, G. / An O(n) bin-packing algorithm for uniformly distributed data. In: Computing. 1986 ; Vol. 36, No. 4. pp. 313-319.
@article{b4faaf2d6ce24225b2b79c9bf78312f9,
title = "An O(n) bin-packing algorithm for uniformly distributed data",
abstract = "We give a first-fit type algorithm, with running time O(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm is O(n2/3).",
keywords = "bin-packing heuristic algorithm, on-line algorithm, One-dimensional packing, probabilistic analysis",
author = "J. Csirik and G. Galambos",
year = "1986",
month = "12",
doi = "10.1007/BF02240206",
language = "English",
volume = "36",
pages = "313--319",
journal = "Computing (Vienna/New York)",
issn = "0010-485X",
publisher = "Springer Wien",
number = "4",

}

TY - JOUR

T1 - An O(n) bin-packing algorithm for uniformly distributed data

AU - Csirik, J.

AU - Galambos, G.

PY - 1986/12

Y1 - 1986/12

N2 - We give a first-fit type algorithm, with running time O(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm is O(n2/3).

AB - We give a first-fit type algorithm, with running time O(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm is O(n2/3).

KW - bin-packing heuristic algorithm

KW - on-line algorithm

KW - One-dimensional packing

KW - probabilistic analysis

UR - http://www.scopus.com/inward/record.url?scp=0022579096&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022579096&partnerID=8YFLogxK

U2 - 10.1007/BF02240206

DO - 10.1007/BF02240206

M3 - Article

AN - SCOPUS:0022579096

VL - 36

SP - 313

EP - 319

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 4

ER -