The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the hardness of approximating minimization problems
Open accessAbstract
We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring, Set Covering and other related minimization problems.Specifically, there is an E > 0 such that Graph Coloring cannot be approximated with ratio n' unless P = NP.Set Covering cannot be approximated with ratio c log n for any c < l/4 unless NP is contained in DTIME(nP"Y'"~").Similar results follow for related problems such as Clique Cover, Fractional Chromatic Number, Dominating Set, and others.
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
Self-citation
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
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Analytical approach to parallel repetition
Dinur, I., & Steurer, D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591884 · Cited by 406
Aragones, E., Gilboa, I., Postlewaite, A., & Schmeidler, D. (2005) · American Economic Review · doi:10.1257/000282805775014308 · Cited by 123
TopLog: ILP Using a Logic Program Declarative Bias
Muggleton, S. H., Santos, J. C. A., & Tamaddoni-Nezhad, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89982-2_58 · Cited by 29
Metadata
- Authors
- Lund, C., & Yannakakis, M.
- Venue
- Journal of the ACM
- Published
- 1994-09
- Volume
- 41
- Issue
- 5
- Pages
- 960-981
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2059453880
- Cited by
- 872
- References
- 1
- FWCI
- 25.70
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the hardness of approximating minimization problems. https://app.cochat.ai/papers/10.1145/185675.306789
- The paper
- Lund, C., & Yannakakis, M. (1994). On the hardness of approximating minimization problems. Journal of the ACM. https://doi.org/10.1145/185675.306789
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.
