The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An Analysis of the Greedy Heuristic for Independence Systems
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Optimal Matching for Observational Studies
Rosenbaum, P. R. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478868 · Cited by 715
An analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
An axiomatic approach for result diversification
Gollapudi, S., & Sharma, A. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526761 · Cited by 389
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
Frieze, A. M., Galbiati, G., & Maffioli, F. (1982) · Networks · doi:10.1002/net.3230120103 · Cited by 252
Metadata
- Authors
- Korte, B., & Hausmann, D.
- Venue
- Annals of Discrete Mathematics
- Publisher
- Elsevier
- Published
- 1978
- Pages
- 65-74
- ISSN
- 0167-5060 (ISSN-L)
- OpenAlex
- W1599161138
- Cited by
- 190
- References
- 1
- FWCI
- 17.89
- Type
- book chapter
- 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: An Analysis of the Greedy Heuristic for Independence Systems. https://app.cochat.ai/papers/10.1016/s0167-5060(08)70322-4
- The paper
- Korte, B., & Hausmann, D. (1978). An Analysis of the Greedy Heuristic for Independence Systems. Annals of Discrete Mathematics. https://doi.org/10.1016/s0167-5060(08)70322-4
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.