The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
A Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 664
Approximation Algorithms for the Set Covering and Vertex Cover Problems
Hochbaum, D. S. (1982) · SIAM Journal on Computing · doi:10.1137/0211045 · Cited by 506
A linear-time approximation algorithm for the weighted vertex cover problem
Bar-Yehuda, R., & Even, S. (1981) · Journal of Algorithms · doi:10.1016/0196-6774(81)90020-1 · Cited by 430
Self-citationFinding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
Efficient bounds for the stable set, vertex cover and set packing problems
Hochbaum, D. S. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90080-x · Cited by 272
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Bomze, I. M., Budinich, M., Pardalos, P. M., & Pelillo, M. (1999) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4757-3023-4_1 · Cited by 1,148
On the hardness of approximating vertex cover
Dinur, I., & Safra, S. (2005) · Annals of Mathematics · doi:10.4007/annals.2005.162.439 · Cited by 636
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
Bellare, M., Goldreich, O., & Sudan, M. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539796302531 · Cited by 453
Metadata
- Authors
- Bar-Yehuda, R., & Even, S.
- Venue
- North-Holland Mathematics Studies
- Publisher
- Elsevier
- Published
- 1985
- Pages
- 27-45
- ISSN
- 0304-0208 (ISSN-L)
- OpenAlex
- W1572977974
- Cited by
- 404
- References
- 9
- FWCI
- 0.00
- 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: A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. https://app.cochat.ai/papers/10.1016/s0304-0208(08)73101-3
- The paper
- Bar-Yehuda, R., & Even, S. (1985). A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. North-Holland Mathematics Studies. https://doi.org/10.1016/s0304-0208(08)73101-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.