The DOI matches its Crossref record; 68 of the 68 references it cites were found in a registry or an index.
Steiner tree problems
Abstract
We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up‐to‐date bibliography which covers more than three hundred items.
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
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Biology · doi:10.1093/sysbio/20.4.406 · Cited by 6,492
Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology
Fitch, W. M. (1971) · Systematic Zoology · doi:10.2307/2412116 · Cited by 5,635
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
Phylogenetic analysis: models and estimation procedures
(2018) · Phylogenetic Inference, Selection Theory, and History of Science · doi:10.1017/9781316276259.010 · Cited by 2,260
PHYLOGENIES FROM MOLECULAR SEQUENCES: INFERENCE AND RELIABILITY
Felsenstein, J. (1988) · Annual Review of Genetics · doi:10.1146/annurev.ge.22.120188.002513 · Cited by 2,128
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Methods for Computing Wagner Trees
Farris, J. S. (1970) · Systematic Biology · doi:10.1093/sysbio/19.1.83 · Cited by 1,222
A fast algorithm for Steiner trees
Kou, L., Markowsky, G., & Berman, L. (1981) · Acta Informatica · doi:10.1007/bf00288961 · Cited by 1,188
Cited by
Chen, S., & Nahrstedt, K. (1998) · IEEE Network · doi:10.1109/65.752646 · Cited by 874
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
Performance optimization of VLSI interconnect layout
Cong, J., He, L., Koh, C.-K., & Madden, P. H. (1996) · Integration · doi:10.1016/s0167-9260(96)00008-9 · Cited by 334
Clever Support: Efficient Support Structure Generation for Digital Fabrication
Vanek, J., Galicia, J. A. G., & Benes, B. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12437 · Cited by 268
Quantum circuit optimizations for NISQ architectures
Nash, B., Gheorghiu, V., & Mosca, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab79b1 · Cited by 139
Metadata
- Authors
- Hwang, F. K., & Richards, D. S.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1992-01
- Volume
- 22
- Issue
- 1
- Pages
- 55-89
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2042492403
- Cited by
- 663
- References
- 68
- FWCI
- 19.08
- 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: Steiner tree problems. https://app.cochat.ai/papers/10.1002/net.3230220105
- The paper
- Hwang, F. K., & Richards, D. S. (1992). Steiner tree problems. Networks. https://doi.org/10.1002/net.3230220105
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.
