The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Approximate Algorithms for the 0/1 Knapsack Problem
Open accessAbstract
A serms of increasingly accurate algorithms to obtain approximate solutions to the 0/1 one-dlmensmnal knapsack problem :s presented Each algorithm guarantees a certain minimal closeness to the optimal solution value The approximate algorithms are of polynomml time complexity and reqmre only linear storage Computatmnal expermnce with these algorithms is also presented KEY WORDS ANn PHRASES knapsack problem, approximation, algomthm, efficiency CR CATEGORIES : 5.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
Computing Partitions with Applications to the Knapsack Problem
Horowitz, E., & Sahni, S. K. (1974) · Journal of the ACM · doi:10.1145/321812.321823 · Cited by 605
Self-citationApproximation algorithms for combinatorial problems
Johnson, D. S. (1973) · Proceedings of the fifth annual ACM symposium on Theory of computing - STOC '73 · doi:10.1145/800125.804034 · Cited by 272
Cited by
P-Complete Approximation Problems
Sahni, S., & Gonzalez, T. (1976) · Journal of the ACM · doi:10.1145/321958.321975 · Cited by 1,703
Self-citationProof verification and the hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1998) · Journal of the ACM · doi:10.1145/278298.278306 · Cited by 1,413
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Ibarra, O. H., & Kim, C. E. (1975) · Journal of the ACM · doi:10.1145/321906.321909 · Cited by 959
Proof verification and hardness of approximation problems
Arora, S., Lund, C., Motwani, R., Sudan, M., & Szegedy, M. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267823 · Cited by 741
A note on maximizing a submodular set function subject to a knapsack constraint
Sviridenko, M. (2004) · Operations Research Letters · doi:10.1016/s0167-6377(03)00062-2 · Cited by 690
Algorithms for Scheduling Independent Tasks
Sahni, S. K. (1976) · Journal of the ACM · doi:10.1145/321921.321934 · Cited by 597
Self-citationAlgorithms for Knapsack Problems
Martello, S., & Toth, P. (1987) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)73237-7 · Cited by 466
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
Ageev, A. A., & Sviridenko, M. I. (2004) · Journal of Combinatorial Optimization · doi:10.1023/b:joco.0000038913.96607.c2 · Cited by 363
Strategies for cache and local memory management by global program transformation
Gannon, D., Jalby, W., & Gallivan, K. (1988) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(88)90014-7 · Cited by 350
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
Introducing a new intelligent adaptive learning content generation method
Haghshenas, E., Mazaheri, A., Gholipour, A., Tavakoli, M., Zandi, N., Narimani, H., Rahimi, F., & Nouri, S. (2010) · The Second International Conference on E-Learning and E-Teaching (ICELET 2010) · doi:10.1109/icelet.2010.5708382 · Cited by 14
Metadata
- Authors
- Sahni, S.
- Venue
- Journal of the ACM
- Published
- 1975-01
- Volume
- 22
- Issue
- 1
- Pages
- 115-124
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2089047615
- Cited by
- 349
- References
- 4
- FWCI
- 103.98
- 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
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.