The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Approximation Algorithms for Some Postman Problems
Open accessAbstract
Approxtmatton algorithms for several NP-complete edge-covermg routing problems are presented and analyzed m terms of the worst-case ratio of the cost of the obtained solutmn to the cost of the optimum solutton A worst-case bound of 2 is proved for the mixed postman algortthm of Edmonds and Johnson, and a related algorithm for the mixed postman problem is shown also to have a worst-case bound of 2 A mixed strategy approach ts used to obtain a bound of ~ for the mixed postman problem A second mixed strategy algorithm, for the mtxed postman on a planar graph, ~s shown to have a worst-case bound of KEY WORDS AND PHRASES Chinese postman problem, mixed postman problem, rural postman problem, NPcomplete problems, polynomml-tlme approximation algorithm, heunsuc, worst-case performance bound, m,xed strategy CR CATEGORIES 5 25, 5 39, 8 3
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Cited by
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Approximation algorithms for the geometric covering salesman problem
Arkin, E. M., & Hassin, R. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(94)90008-6 · Cited by 356
A Distributed Consensus-Based Cooperative Spectrum-Sensing Scheme in Cognitive Radios
Li, Z., Yu, F. R., & Huang, M. (2010) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2031181 · Cited by 261
Metadata
- Authors
- Frederickson, G. N.
- Venue
- Journal of the ACM
- Published
- 1979-07
- Volume
- 26
- Issue
- 3
- Pages
- 538-554
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2062403584
- Cited by
- 182
- References
- 1
- FWCI
- 1.68
- 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 Some Postman Problems. https://app.cochat.ai/papers/10.1145/322139.322150
- The paper
- Frederickson, G. N. (1979). Approximation Algorithms for Some Postman Problems. Journal of the ACM. https://doi.org/10.1145/322139.322150
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.
