Some upper bounds for minimal trees (Q1178229): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner trees for bounded point sets
@@ Property / cites work: On Steiner trees for bounded point sets / rank @@
+Normal rank
@@ Property / cites work @@
+The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter
+Normal rank
@@ Property / cites work @@
+The shortest path and the shortest road through             <i>n</i>             points
+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 @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / 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 / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90102-n
+Normal rank
@@ Property / OpenAlex ID @@
+W1964674521
@@ Property / OpenAlex ID: W1964674521 / rank @@
+Normal rank