How to find Steiner minimal trees in Euclidean $d$-space (Q1186793): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear steiner trees: Efficient special-case algorithms
+Normal rank
@@ Property / cites work @@
+Crossing-Free Subgraphs
@@ Property / cites work: Crossing-Free Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Generation of Minimal Trees with a Steiner Topology
+Normal rank
@@ Property / cites work @@
+Q4120590
@@ Property / cites work: Q4120590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3689203
@@ Property / cites work: Q3689203 / rank @@
+Normal rank
@@ Property / cites work @@
+On Fermat's Problem on the Surface of a Sphere
@@ Property / cites work: On Fermat's Problem on the Surface of a Sphere / rank @@
+Normal rank
@@ Property / cites work @@
+Exact computation of Steiner minimal trees in the plane
+Normal rank
@@ Property / cites work @@
+A shortest augmenting path method for solving minimal perfect matching problems
+Normal rank
@@ Property / cites work @@
+The Steiner ratio conjecture is true for five points
+Normal rank
@@ Property / cites work @@
+Steiner minimal trees for regular polygons
@@ Property / cites work: Steiner minimal trees for regular polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding Best Matches in Logarithmic Expected Time
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing Steiner Minimal Trees
@@ Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+On the Solution of Systems of Equations by the Epsilon Algorithm of Wynn
+Normal rank
@@ Property / cites work @@
+The 1-steiner tree problem
@@ Property / cites work: The 1-steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4100104
@@ Property / cites work: Q4100104 / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner’s Problem with Rectilinear Distance
@@ Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank @@
+Normal rank
@@ Property / cites work @@
+Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for full Steiner trees
@@ Property / cites work: A linear time algorithm for full Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem on Euclidean Steiner minimal trees
+Normal rank
@@ Property / cites work @@
+Hexagonal coordinate systems and Steiner minimal trees
+Normal rank
@@ Property / cites work @@
+Some properties of a centroid of a free tree
@@ Property / cites work: Some properties of a centroid of a free tree / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q5534163
@@ Property / cites work: Q5534163 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Fermat's problem
@@ Property / cites work: A note on Fermat's problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Steiner
@@ Property / cites work: On the Problem of Steiner / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small simple cycle separators for 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+On the Betti Numbers of Real Varieties
@@ Property / cites work: On the Betti Numbers of Real Varieties / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Euclidean maximum spanning trees
@@ Property / cites work: Computing Euclidean maximum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Convexity and the Steiner tree problem
@@ Property / cites work: Convexity and the Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
+Normal rank
@@ Property / cites work @@
+Q3707420
@@ Property / cites work: Q3707420 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Approximation by Nonlinear Manifolds
+Normal rank
@@ Property / cites work @@
+An algorithm for the steiner problem in the euclidean plane
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01758756
+Normal rank
@@ Property / OpenAlex ID @@
+W2088967712
@@ Property / OpenAlex ID: W2088967712 / rank @@
+Normal rank

How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793): Difference between revisions

Latest revision as of 11:17, 30 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)