The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Steiner problem in networks: A survey
Abstract
The problem of determining a minimum cost connected network (i.e., weighted graph) G that spans a given subset of vertices is known in the literature as the Steiner problem in networks. We survey exact algorithms and heuristics which appeared in the published literature. We also discuss problems related to the Steiner problem in networks.
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
(1979) · Cited by 43,841
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
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
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Fisher, M. L. (1981) · Management Science · doi:10.1287/mnsc.27.1.1 · Cited by 2,109
Cited by
Hwang, F. K., & Richards, D. S. (1992) · Networks · doi:10.1002/net.3230220105 · Cited by 663
The PIM architecture for wide-area multicast routing
Deering, S., Estrin, D. L., Farinacci, D., Jacobson, V., Liu, C.-G., & Wei, L. (1996) · IEEE/ACM Transactions on Networking · doi:10.1109/90.490743 · Cited by 655
Imase, M., & Waxman, B. M. (1991) · SIAM Journal on Discrete Mathematics · doi:10.1137/0404033 · Cited by 354
Line-of-sight communication on terrain models
De Floriani, L., Marzano, P., & Puppo, E. (1994) · International journal of geographical information systems · doi:10.1080/02693799408902004 · Cited by 124
A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
Frommer, I., & Golden, B. (2007) · Operations Research/Computer Science Interfaces Series · doi:10.1007/978-0-387-48793-9_3 · Cited by 3
Metadata
- Authors
- Winter, P.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1987-01
- Volume
- 17
- Issue
- 2
- Pages
- 129-167
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2172222998
- Cited by
- 599
- References
- 26
- FWCI
- 8.48
- 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 problem in networks: A survey. https://app.cochat.ai/papers/10.1002/net.3230170203
- The paper
- Winter, P. (1987). Steiner problem in networks: A survey. Networks. https://doi.org/10.1002/net.3230170203
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.
