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

The DOI matches its Crossref record.

Orthogonal Packings in Two Dimensions

Baker, Brenda S., Coffman, Jr., E. G., Rivest, Ronald L.·1980·SIAM Journal on Computing

Abstract

We consider problems of packing an arbitrary collection of rectangular pieces into an open-ended, rectangular bin so as to minimize the height achieved by any piece. This problem has numerous applications in operations research and studies of computer operation. We devise efficient approximation algorithms, study their limitations, and derive worst-case bounds on the performance of the packings they produce.

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.1137/0209064

Cites

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

Cited by

See all 700

Metadata

Authors
Baker, B. S., Coffman, Jr., & Rivest, R. L.
Venue
SIAM Journal on Computing
Published
1980-11
Volume
9
Issue
4
Pages
846-855
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2019318803
Cited by
700
References
0
FWCI
48.40
Type
journal article
Language
en
Open access
closed

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: Orthogonal Packings in Two Dimensions. https://app.cochat.ai/papers/10.1137/0209064
The paper
Baker, B. S., Coffman, Jr., & Rivest, R. L. (1980). Orthogonal Packings in Two Dimensions. SIAM Journal on Computing. https://doi.org/10.1137/0209064

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.