The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Some APX-completeness results for cubic graphs
Open accessOverview
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
(1979) · Cited by 43,841
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
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
On the hardness of approximating minimization problems
Lund, C., & Yannakakis, M. (1994) · Journal of the ACM · doi:10.1145/185675.306789 · Cited by 872
Probabilistic checking of proofs; a new characterization of NP
Arora, S., & Safra, S. (1992) · Proceedings., 33rd Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267824 · Cited by 275
Free bits, PCPs and non-approximability-towards tight results
Bellare, M., Goldreich, O., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492573 · Cited by 265
The complexity and approximability of finding maximum feasible subsystems of linear relations
Amaldi, E., & Kann, V. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00254-g · Cited by 201
Self-citationA 7/8-approximation algorithm for MAX 3SAT?
Karloff, H., & Zwick, U. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646129 · Cited by 168
On approximation properties of the Independent set problem for degree 3 graphs
Berman, P., & Fujito, T. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60220-8_84 · Cited by 89
Completeness in approximation classes
Crescenzi, P., & Panconesi, A. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90025-w · Cited by 87
Metadata
- Authors
- Alimonti, P., & Kann, V.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2000-04
- Volume
- 237
- Issue
- 1-2
- Pages
- 123-134
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2012391569
- Cited by
- 361
- References
- 15
- FWCI
- 3.60
- 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: Some APX-completeness results for cubic graphs. https://app.cochat.ai/papers/10.1016/s0304-3975(98)00158-3
- The paper
- Alimonti, P., & Kann, V. (2000). Some APX-completeness results for cubic graphs. Theoretical Computer Science. https://doi.org/10.1016/s0304-3975(98)00158-3
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.