The DOI matches its Crossref record.
The steiner problem in graphs
Abstract
An algorithm for solving the Steiner problem on a finite undirected graph is presented. This algorithm computes the set of graph arcs of minimum total length needed to connect a specified set of k graph nodes. If the entire graph contains n nodes, the algorithm requires time proportional to n 3/2 + n 2 (2 k‐1 ‐ k ‐ 1) + n(3 k‐1 ‐ 2 k + 3)/2. The time requirement above includes the term n 3/2, which can be eliminated if the set of shortest paths connecting each pair of nodes in the graph is available.
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
The Location of Interacting Hub Facilities
O'Kelly, M. E. (1986) · Transportation Science · doi:10.1287/trsc.20.2.92 · Cited by 631
PARAMETERIZED COMPLEXITY THEORY
Niedermeier, R. (2006) · Invitation to Fixed-Parameter Algorithms · doi:10.1093/acprof:oso/9780198566076.003.0013 · Cited by 574
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
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
Cohanim, B. E., Hewitt, J. N., & de Weck, O. (2004) · The Astrophysical Journal Supplement Series · doi:10.1086/422356 · Cited by 43
Metadata
- Authors
- Dreyfus, S. E., & Wagner, R. A.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1971-01
- Volume
- 1
- Issue
- 3
- Pages
- 195-207
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W1996668544
- Cited by
- 696
- References
- 0
- FWCI
- 2.83
- 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: The steiner problem in graphs. https://app.cochat.ai/papers/10.1002/net.3230010302
- The paper
- Dreyfus, S. E., & Wagner, R. A. (1971). The steiner problem in graphs. Networks. https://doi.org/10.1002/net.3230010302
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.
