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

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

Approximation Algorithms for Bin-Packing — An Updated Survey

Coffman, E. G., Garey, M. R., Johnson, D. S. · 1984 · CISM International Centre for Mechanical Sciences

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-7091-4338-4_3

Cites

89 of 89 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 92 references

Research works printed but not linked: 12

  1. Assmann, S. B., Doctoral Dissertation, Department of Mathematics, M.I.T., Cambridge, Mass. (1983).
  2. Biro, M. and Boros, E., “A network flow approach to non-guillotine cutting problems,” Working Paper MO/30 (1982), Computer and Automation Institute, Hungarian Academy of Sciences, Budapest.
  3. Brown, A. R., Optimum Packing and Depletion, American Elsevier, New York (1971).
  4. Garey, M. R., Graham, R. L., and Johnson, D. S., “On a number-theoretic bin packing conjecture,” Proc. 5th Hungarian Combinatorics Colloquium, North-Holland, Amsterdam (1978), 377–392.
  5. Golan, I., “Two orthogonal oriented algorithms for packing in two dimension,” Report 1979/311/MHM, Computer Center M.O.D., P. O. Box 2250, Haifa, Israel (1979).
  6. Graham, R. L., “Bounds on performnce of scheduling algorithms,” in E. G. Coffman, Jr. (ed.), Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York (1976), 165–227.
  7. Hofri, M., “Bin-packing: An analysis of the Next-Fit algorithm,” Tech. Rep. No. 242, Dept. of Computer Science, The Technion, Haifa, Israel (1982).
  8. Knuth, D. E., Fundamental Algorithms, Vol. 1, Second edition, Addison-Wesley (1973).
  9. Langston, M. A., Processor Scheduling with Improved Heuristic Algorithms, Doctoral dissertation, Texas A&M University, College Station, Texas (1981).
  10. Langston, M. A., “Improved LPT scheduling for identical processor systems,” RAIRO-Technique et Science Informatiques, 1 (1982), 69–75.
  11. Loulou, R., “Probabilistic behavior of optimal bin packing solutions,” Tech. Rep., Faculty of Management, McGill University, Montreal (1982).
  12. Schrijver, A. (ed.), Packing and Covering in Combinatorics, published by Mathematical Centre, Tweede Boerhaavestraat 49, Amsterdam (1979).

Cited by

See all 442

Metadata

Authors
Coffman, E. G., Garey, M. R., & Johnson, D. S.
Venue
CISM International Centre for Mechanical Sciences
Published
1984
Pages
49-106
ISSN
  • 0254-1971 (ISSN-L)
  • 2309-3706
OpenAlex
W1519941054
Cited by
433
References
92
Citations by year
2026: 4 · 2025: 8 · 2024: 11 · 2023: 5 · 2022: 7 · 2021: 14 · 2020: 8 · 2019: 14 · 2018: 9 · 2017: 7 · 2016: 7 · 2015: 8 · 2014: 8 · 2013: 7 · 2012: 3
FWCI
61.09
Type
book chapter
Language
en
Open access
closed
Locations
Courses and lectures (publishedVersion)
Topics
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Optimization and Packing Problems
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
Keywords
bin packing, approximation algorithms, approximation ratio, scheduling, combinatorial optimization

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: Approximation Algorithms for Bin-Packing — An Updated Survey. https://app.cochat.ai/papers/10.1007/978-3-7091-4338-4_3
The paper
Coffman, E. G., Garey, M. R., & Johnson, D. S. (1984). Approximation Algorithms for Bin-Packing — An Updated Survey. CISM International Centre for Mechanical Sciences. https://doi.org/10.1007/978-3-7091-4338-4_3

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.