The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Steiner Minimal Trees
Abstract
A Steiner minimal tree for given points $A_1 , \cdots ,A_n $ in the plane is a tree which interconnects these points using lines of shortest possible total length. In order to achieve minimum length the Steiner minimal tree may contain other vertices (Steiner points) beside $A_1 , \cdots ,A_n $. We find conditions which simplify the task of constructing a Steiner minimal tree. Some of these use relationships with the easily constructed (ordinary) minimal tree which achieves minimum length among all trees having only $A_1 , \cdots ,A_n $ as vertices. Other questions concern the relative lengths of these two trees in extreme or typical cases. A review of the existing literature is included.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“note that the task of computing a minimally linked network with Steiner points is an NP-hard problem, i.e. not solvable in reasonable time, even for relatively small data sets: Gilbert and Pollak, 1968”
From Exploratory network reconstruction with sparse archaeological data and XTENT (2022) · cites this paper as Gilbert and Pollak, 1968
Citations
Cites
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
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
Coxeter, H. S. M. (1969) · Cited by 1,582
On Steiner’s Problem with Rectilinear Distance
Hanan, M. (1966) · SIAM Journal on Applied Mathematics · doi:10.1137/0114025 · Cited by 623
Petersen, G. M., & Coxeter, H. S. M. (1961) · The American Mathematical Monthly · doi:10.2307/2311833 · Cited by 540
O'Beirne, T. H. (1962) · Physics Bulletin · doi:10.1088/0031-9112/13/7/027 · Cited by 472
Melzak, Z. A. (1961) · Canadian Mathematical Bulletin · doi:10.4153/cmb-1961-016-2 · Cited by 281
Yates, R. C., & Steinhaus, H. (1939) · National Mathematics Magazine · doi:10.2307/3028742 · Cited by 94
On the Shortest Path Through a Number of Points
Verblunsky, S. (1951) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1951-0045403-1 · Cited by 53
Gilbert, E. N. (1965) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0113021 · Cited by 46
Self-citation
Research works printed but not linked: 8
- Courant Richard, 1941, What Is Mathematics?
- 10.2307/2688424 · doi:10.2307/2688424
- Loo-Keng Hua, 1962, Chinese Math., 2, 77
- Kuhn Harold W., 1966, J. Regional Science, 4, 21, 10.1111/j.1467-9787.1962.tb00902.x · doi:10.1111/j.1467-9787.1962.tb00902.x
- Maxwell J. C., 1864, Cambridge Philos. Mag.
- Maxwell J. C., 1869, Trans. Roy. Soc. Edinburgh, 26
- 10.2307/2689310 · doi:10.2307/2689310
- Weber Alfred, 1929, über den Standort der Industrien, Tübingen, 1909, Chap. III.
Cited by
Routing of multipoint connections
Waxman, B. M. (1988) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.12889 · Cited by 2,885
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Handbook of Combinatorial Optimization
(1999) · Springer eBooks · doi:10.1007/978-1-4757-3023-4 · Cited by 1,216
A fast algorithm for Steiner trees
Kou, L., Markowsky, G., & Berman, L. (1981) · Acta Informatica · doi:10.1007/bf00288961 · Cited by 1,188
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
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
On the History of the Minimum Spanning Tree Problem
Graham, R. L., & Hell, P. (1985) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1985.10011 · Cited by 813
Convex hulls of finite sets of points in two and three dimensions
Preparata, F. P., & Hong, S. J. (1977) · Communications of the ACM · doi:10.1145/359423.359430 · Cited by 710
Dreyfus, S. E., & Wagner, R. A. (1971) · Networks · doi:10.1002/net.3230010302 · Cited by 696
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
The Location of Interacting Hub Facilities
O'Kelly, M. E. (1986) · Transportation Science · doi:10.1287/trsc.20.2.92 · Cited by 631
Steiner problem in networks: A survey
Winter, P. (1987) · Networks · doi:10.1002/net.3230170203 · Cited by 599
The Complexity of Computing Steiner Minimal Trees
Garey, M. R., Graham, R. L., & Johnson, D. S. (1977) · SIAM Journal on Applied Mathematics · doi:10.1137/0132072 · Cited by 576
Wang, X., Ding, B., Sun, G., Wang, M., & Yu, J. (2013) · Progress in Materials Science · doi:10.1016/j.pmatsci.2013.05.001 · Cited by 533
Polynomial 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
Multistructured Electrospun Nanofibers for Air Filtration: A Review
Lu, T., Cui, J., Qu, Q., Wang, Y., Zhang, J., Xiong, R., Ma, W., & Huang, C. (2021) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.1c06520 · Cited by 447
Geometric Shortest Paths and Network Optimization
Mitchell, J. S. B. (2000) · Handbook of Computational Geometry · doi:10.1016/b978-044482537-7/50016-4 · Cited by 427
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
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
Steiner's problem in graphs and its implications
Hakimi, S. L. (1971) · Networks · doi:10.1002/net.3230010203 · Cited by 347
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
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
Exploratory network reconstruction with sparse archaeological data and XTENT
Ducke, B., & Suchowska, P. (2022) · Journal of Archaeological Method and Theory · doi:10.1007/s10816-021-09529-3 · Cited by 12
Metadata
- Authors
- Gilbert, E. N., & Pollak, H. O.
- Venue
- SIAM Journal on Applied Mathematics
- Published
- 1968-01
- Volume
- 16
- Issue
- 1
- Pages
- 1-29
- ISSN
- 0036-1399
- 1095-712X
- Cited by
- 690
- References
- 15
- Language
- en
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
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.