Author:
Rubinstein J.H.,Thomas D.A.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. The Steiner ratio conjecture is true for five points;Du;J. Combin. Theory Ser. A,1985
2. A short proof of a result of Pollak on Steiner minimal trees;Du;J. Combin. Theory Ser. A,1982
3. The complexity of computing Steiner minimal trees;Garey;SIAM J. Appl. Math.,1977
4. Steiner minimal trees;Gilbert;SIAM J. Appl. Math.,1968
5. On the shortest spanning subtree of a graph and the travelling salesman problem;Kruskal,1956
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Steiner Tree Problems;Encyclopedia of Optimization;2024
2. Restriction and Steiner Tree;Introduction to Combinatorial Optimization;2022
3. Solving the prize‐collecting Euclidean Steiner tree problem;International Transactions in Operational Research;2020-08-05
4. Directional derivative of the weight of a minimal filling in Riemannian manifolds;Moscow University Mathematics Bulletin;2015-01
5. Design and Analysis of Approximation Algorithms;Springer Optimization and Its Applications;2012