The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Tighter Bounds for Graph Steiner Tree Approximation
Abstract
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic that achieves a best-known approximation ratio of $1 + \frac{\ln 3}{2} \approx 1.55$ for general graphs and best-known approximation ratios of $\approx 1.28$ for both quasi-bipartite graphs (i.e., where no two nonterminals are adjacent) and complete graphs with edge weights 1 and 2. Our method is considerably simpler and easier to implement than previous approaches. We also prove the first known nontrivial performance bound ($1.5 \cdot$ OPT) for the iterated 1-Steiner heuristic of Kahng and Robins in quasi-bipartite graphs.
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
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
The Rectilinear Steiner Tree Problem is $NP$-Complete
Garey, M. R., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132071 · Cited by 1,124
An approximate solution for the Steiner problem in graphs
Takahashi, H., & Matsuyama, A. (1980) · Mathematica japonica · Cited by 878
Hwang, F. K., Richards, D., & Winter, P. (1992) · Cited by 855
Improved Steiner tree approximation in graphs
Robins, G., & Zelikovsky, A. (2000) · doi:10.5555/338219.338638 · Cited by 524
Self-citationPolynomial time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548458 · Cited by 449
A faster approximation algorithm for the Steiner problem in graphs
Mehlhorn, K. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90066-x · Cited by 420
A new class of iterative Steiner tree heuristics with good performance
Kahng, A. B., & Robins, G. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.144853 · Cited by 215
Self-citationOn Optimal Interconnections for VLSI
Kahng, A. B., & Robins, G. (1995) · Springer eBooks · doi:10.1007/978-1-4757-2363-2 · Cited by 200
Self-citationNew Approximation Algorithms for the Steiner Tree Problems
Karpinski, M., & Zelikovsky, A. (1997) · Journal of Combinatorial Optimization · doi:10.1023/a:1009758919736 · Cited by 192
Self-citation
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
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
NODLINK: An Online System for Fine-Grained APT Attack Detection and Investigation
Li, S., Dong, F., Xiao, X., Wang, H., Shao, F., Chen, J., Guo, Y., Chen, X., & Li, D. (2024) · Proceedings 2024 Network and Distributed System Security Symposium · doi:10.14722/ndss.2024.23204 · Cited by 45
Reducing the CNOT count for Clifford+T circuits on NISQ architectures
Gheorghiu, V., Huang, J., Li, S. M., Mosca, M., & Mukhopadhyay, P. (2020) · arXiv · doi:10.48550/arxiv.2011.12191 · Cited by 31
Metadata
- Authors
- Robins, G., & Zelikovsky, A.
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 2005-01
- Volume
- 19
- Issue
- 1
- Pages
- 122-134
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W2039298646
- Cited by
- 327
- References
- 12
- FWCI
- 10.67
- 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: Tighter Bounds for Graph Steiner Tree Approximation. https://app.cochat.ai/papers/10.1137/s0895480101393155
- The paper
- Robins, G., & Zelikovsky, A. (2005). Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s0895480101393155
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.