Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 281

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

New Algorithms for Bin Packing

Open access
Yao, Andrew Chi-Chih·1980·Journal of the ACM

Abstract

In the bin-packing problem a list L of n numbers are to be packed into unit-capacity bins. For any algorithm S , let r ( S ) be the maximum ratio S ( L )/ L * for large L * , where S ( L ) denotes the number of bins used by S and L * denotes the minimum number needed. An on-line Ο ( n log n )-time algorithm RFF with r (RFF) = 5/3 and an off-line polynomial-time algorithm RFFD with r (RFFD) ≤ 11/9 - ε for some fixed ε > 0, are given. These are strictly better, respectively, than two prominent algorithms: the First-Fit (FF), which is on-line with r (FF) = 17/10, and the First-Fit-Decreasing (FFD) with r (FFD) = 11/9. Furthermore, it is shown that any on-line algorithm S must have r ( S ) ≥ 3/2. The question, “How well can an ο ( n log n )-time algorithm perform?” is also discussed. It is shown that in the generalized d -dimensional bin packing, any ο ( n log n )-time algorithm S must have r ( S ) ≥ d .

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/322186.322187

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 281

Metadata

Authors
Yao, A. C.-C.
Venue
Journal of the ACM
Published
1980-04
Volume
27
Issue
2
Pages
207-227
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W2005908084
Cited by
281
References
5
FWCI
25.81
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: New Algorithms for Bin Packing. https://app.cochat.ai/papers/10.1145/322186.322187
The paper
Yao, A. C.-C. (1980). New Algorithms for Bin Packing. Journal of the ACM. https://doi.org/10.1145/322186.322187

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.