The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Approximation algorithms for the geometric covering salesman problem
Open accessOverview
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
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
The Euclidean travelling salesman problem is NP-complete
Papadimitriou, C. H. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90012-3 · Cited by 776
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Approximation Algorithms for Some Routing Problems
Frederickson, G. N., Hecht, M. S., & Kim, C. E. (1978) · SIAM Journal on Computing · doi:10.1137/0207017 · Cited by 427
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
A note on the prize collecting traveling salesman problem
Bienstock, D., Goemans, M. X., Simchi-Levi, D., & Williamson, D. (1993) · Mathematical Programming · doi:10.1007/bf01581256 · Cited by 280
Approximation Algorithms for Some Postman Problems
Frederickson, G. N. (1979) · Journal of the ACM · doi:10.1145/322139.322150 · Cited by 182
Cited by
Otto, A., Agatz, N., Campbell, J., Golden, B., & Pesch, E. (2018) · Networks · doi:10.1002/net.21818 · Cited by 985
“We refer the interested reader to Arkin and Hassin [16], de Berg et al.”
MethodGeometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
Metadata
- Authors
- Arkin, E. M., & Hassin, R.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1994-12
- Volume
- 55
- Issue
- 3
- Pages
- 197-218
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W2110824994
- Cited by
- 356
- References
- 7
- FWCI
- 5.67
- 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: Approximation algorithms for the geometric covering salesman problem. https://app.cochat.ai/papers/10.1016/0166-218x(94)90008-6
- The paper
- Arkin, E. M., & Hassin, R. (1994). Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics. https://doi.org/10.1016/0166-218x(94)90008-6
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.
