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

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

Bin Packing Approximation Algorithms: Survey and Classification

Coffman, Edward G., Csirik, János, Galambos, Gábor, Martello, Silvano, Vigo, Daniele · 2013 · Handbook of Combinatorial Optimization

Overview

Integrity signals

Registry

Crossref · 10.1007/978-1-4419-7997-1_35

Cites

181 of 181 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.

Citations

Cites

Show all 181 references

Research works printed but not linked: 11

  1. S. Albers, Better bounds for on-line scheduling, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 130–139 $$\bullet \ \ mincap\vert \mathit{on - line}\vert R_{A}\mathit{bound}.$$
  2. J. Csirik, B. Imreh, On the worst-case performance of the Next-k-Fit bin-packing heuristic. Acta Cybern. 9, 89–105 (1989) $$\bullet \ \ pack\vert \mathit{bounded - space}\vert R_{A}^{\infty }\mathit{bounds}.$$
  3. J. Csirik, V. Totik, On-line algorithms for a dual version of bin packing. Discret. Appl. Math. 21, 163–167 (1988) $$\bullet \ \ cover\vert \mathit{on - line}\vert R_{A}^{\infty }\mathit{bound}.$$
  4. J. Csirik, G. Galambos, G. Turan, Some results on bin-packing, in Proceedings of the EURO VI Conference, Vienna, Austria, 1983, pp. 52 $$\bullet \ \ pack\vert \mathit{on - line},\mathit{off - line}\vert R_{A}^{\infty }.$$
  5. G. Gambosi, A. Postiglione, M. Talamo, New algorithms for on-line bin packing, in Algorithms and Complexity, ed. by R. Petreschi, G. Ausiello, D.P. Bovet (World Scientific, Singapore, 1990), pp. 44–59. This is the preliminary version of [99]
  6. L.A. Hall, Approximation algorithms for scheduling, in Approximation Algorithms for NP-Hard Problems, ed. by D.S. Hochbaum (PWS Publishing Company, Boston, 1997), pp. 1–45
  7. D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems (PWS Publishing Company, Boston, 1997)
  8. D.S. Hochbaum, Various notions of approximation: good, better, best, and more, in Approximation Algorithms for NP-Hard Problems, ed. by D.S. Hochbaum (PWS Publishing Company, Boston, 1997), pp. 389–391
  9. K.A. Kierstead, W.T. Trotter, An extremal problem in recursive combinatorics. Congr. Numer. 33, 143–153 (1981)
  10. A. van Vliet, Lower and Upper Bounds for On-Line Bin Packing and Scheduling Heuristic. PhD thesis, Erasmus University, Rotterdam, 1995
  11. K. Xu, A Bin-Packing Problem with Item Sizes in the Interval $$(0,\alpha ]$$ for $$\alpha \leq \frac{1} {2}.$$ PhD thesis, Chinese Academy of Sciences, Institute of Applied Mathematics, Beijing, China, 1993

Cited by

See all 289

Metadata

Authors
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D.
Affiliations
  • Columbia University (US)
  • University of Szeged (HU)
Venue
Handbook of Combinatorial Optimization
Published
2013
Pages
455-531
OpenAlex
W90213227
Cited by
289
References
181
Citations by year
2026: 9 · 2025: 14 · 2024: 21 · 2023: 29 · 2022: 17 · 2021: 24 · 2020: 35 · 2019: 32 · 2018: 27 · 2017: 28 · 2016: 15 · 2015: 20 · 2014: 17 · 2013: 1
FWCI
72.62
Type
book chapter
Language
en
Open access
closed
Licence
Locations
  • Springer eBooks (publishedVersion)
  • VU Research Portal (publishedVersion)
  • Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
  • Data Archiving and Networked Services (DANS) (submittedVersion)
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 › Mathematics › Theoretical Computer Science › Optimization and Search Problems
Keywords
bin packing, approximation algorithms, performance guarantees, online algorithms, offline algorithms, algorithm classification

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: Bin Packing Approximation Algorithms: Survey and Classification. https://app.cochat.ai/papers/10.1007/978-1-4419-7997-1_35
The paper
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin Packing Approximation Algorithms: Survey and Classification. Handbook of Combinatorial Optimization. https://doi.org/10.1007/978-1-4419-7997-1_35

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.