The DOI matches its Crossref record.
An approximation algorithm for the generalized assignment problem
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.
Integrity signals
Registry
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.
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
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Self-citationOn the approximability of trade-offs and optimal access of Web sources
Papadimitriou, C. H., & Yannakakis, M. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892068 · Cited by 458
Pu, L., Chen, X., Xu, J., & Fu, X. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2624118 · Cited by 369
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Chekuri, C., & Khanna, S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539700382820 · Cited by 332
The Way They Move: Tracking Multiple Targets with Similar Appearance
Dicle, C., Camps, O. I., & Sznaier, M. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.286 · Cited by 306
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2011) · Mathematics of Operations Research · doi:10.1287/moor.1110.0499 · Cited by 65
Metadata
- Authors
- Shmoys, D. B., & Tardos, É.
- Venue
- Mathematical Programming
- Published
- 1993-02
- Volume
- 62
- Issue
- 1-3
- Pages
- 461-474
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2014369282
- Cited by
- 726
- References
- 0
- FWCI
- 4.30
- 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
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.