Random-order bin packing

Edward G. Coffman, J. Csirik, L. Rónyai, Ambrus Zsbán

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e., it is 2.

Original languageEnglish
Pages (from-to)2810-2816
Number of pages7
JournalDiscrete Applied Mathematics
Volume156
Issue number14
DOIs
Publication statusPublished - Jul 28 2008

Fingerprint

Bin Packing
Bins
Heuristics
Average-case Analysis
Analysis of Algorithms
Performance Metrics
Annual
Upper and Lower Bounds
Alternatives

Keywords

  • Bin packing
  • Worst-case analysis

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Random-order bin packing. / Coffman, Edward G.; Csirik, J.; Rónyai, L.; Zsbán, Ambrus.

In: Discrete Applied Mathematics, Vol. 156, No. 14, 28.07.2008, p. 2810-2816.

Research output: Contribution to journalArticle

Coffman, Edward G. ; Csirik, J. ; Rónyai, L. ; Zsbán, Ambrus. / Random-order bin packing. In: Discrete Applied Mathematics. 2008 ; Vol. 156, No. 14. pp. 2810-2816.
@article{595ab411b3c74d8da6212d4503ca8477,
title = "Random-order bin packing",
abstract = "The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e., it is 2.",
keywords = "Bin packing, Worst-case analysis",
author = "Coffman, {Edward G.} and J. Csirik and L. R{\'o}nyai and Ambrus Zsb{\'a}n",
year = "2008",
month = "7",
day = "28",
doi = "10.1016/j.dam.2007.11.004",
language = "English",
volume = "156",
pages = "2810--2816",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "14",

}

TY - JOUR

T1 - Random-order bin packing

AU - Coffman, Edward G.

AU - Csirik, J.

AU - Rónyai, L.

AU - Zsbán, Ambrus

PY - 2008/7/28

Y1 - 2008/7/28

N2 - The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e., it is 2.

AB - The average-case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [C. Kenyon, Best-fit bin-packing with random order, in: Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1996, pp. 359-364] Kenyon introduced the random-order ratio, a new average-case performance metric for bin packing heuristics, and gave upper and lower bounds for it for the Best Fit heuristics. We introduce an alternative definition of the random-order ratio and show that the two definitions give the same result for Next Fit. We also show that the random-order ratio of Next Fit equals to its asymptotic worst-case, i.e., it is 2.

KW - Bin packing

KW - Worst-case analysis

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

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

U2 - 10.1016/j.dam.2007.11.004

DO - 10.1016/j.dam.2007.11.004

M3 - Article

AN - SCOPUS:50649124439

VL - 156

SP - 2810

EP - 2816

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 14

ER -