The Steiner problem with edge lengths 1 and 2 (Q1123630): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(89)90039-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2070664846
@@ Property / OpenAlex ID: W2070664846 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3689203
@@ Property / cites work: Q3689203 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Minimal Trees
@@ Property / cites work: Steiner Minimal Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On Steiner Minimal Trees with Rectilinear Distance
+Normal rank
@@ Property / cites work @@
+Q3797192
@@ Property / cites work: Q3797192 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster approximation algorithm for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Q3322143
@@ Property / cites work: Q3322143 / rank @@
+Normal rank
@@ Property / cites work @@
+The computation of nearly minimal Steiner trees in graphs
+Normal rank
@@ Property / cites work @@
+Worst-case performance of Rayward-Smith's Steiner tree heuristic
+Normal rank
@@ Property / cites work @@
+Steiner problem in networks: A survey
@@ Property / cites work: Steiner problem in networks: A survey / rank @@
+Normal rank