The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A threshold of ln n for approximating set cover (preliminary version)
Open accessAbstract
We prove that (] -o(]))lnn is a threshold below which set, cover cannot be approximated efficiently, unless NP has slightly superpolynornial time algorithms.This closes tlw gap (up to low order terms) between the ratio of ap-prox&ation achievable by the greedy algorithm (which is (1 -O( 1 ) ) in n), and previous results of Lund and Yannakakis, that showed harclness of approximation within a ratio of (log2 7/)/2 E 0.7.?111 //,, 1
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
Cites
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653
Cited by
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
Selection of views to materialize in a data warehouse
Gupta, H., & Mumick, I. S. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.16 · Cited by 280
Metadata
- Authors
- Feige, U.
- Venue
- Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 314-318
- OpenAlex
- W2000869424
- Cited by
- 214
- References
- 1
- FWCI
- 17.14
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A threshold of ln n for approximating set cover (preliminary version). https://app.cochat.ai/papers/10.1145/237814.237977
- The paper
- Feige, U. (1996). A threshold of ln n for approximating set cover (preliminary version). Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.237977
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.
