The DOI matches its Crossref record.
New Approximation Algorithms for the Steiner Tree Problems
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
Cited by
An improved LP-based approximation for steiner tree
Byrka, J., Grandoni, F., Rothvoß, T., & Sanità, L. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806769 · Cited by 296
Steiner Tree Approximation via Iterative Randomized Rounding
Byrka, J., Grandoni, F., Rothvoss, T., & Sanità, L. (2013) · Journal of the ACM · doi:10.1145/2432622.2432628 · Cited by 281
Steiner tree based optimal resource caching scheme in fog computing
Su, J., Lin, F., Zhou, X., & Lu, X. (2015) · China Communications · doi:10.1109/cc.2015.7224698 · Cited by 113
Metadata
- Authors
- Karpinski, M., & Zelikovsky, A.
- Venue
- Journal of Combinatorial Optimization
- Published
- 1997-03
- Volume
- 1
- Issue
- 1
- Pages
- 47-65
- ISSN
- 1382-6905 (ISSN-L)
- 1573-2886
- OpenAlex
- W109985799
- Cited by
- 192
- References
- 0
- FWCI
- 12.66
- Type
- journal article
- 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: New Approximation Algorithms for the Steiner Tree Problems. https://app.cochat.ai/papers/10.1023/a:1009758919736
- The paper
- Karpinski, M., & Zelikovsky, A. (1997). New Approximation Algorithms for the Steiner Tree Problems. Journal of Combinatorial Optimization. https://doi.org/10.1023/a%3A1009758919736
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.