The computation of nearly minimal Steiner trees in graphs (Q4750659): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/0020739830140103
+Normal rank
@@ Property / OpenAlex ID @@
+W2082150701
@@ Property / OpenAlex ID: W2082150701 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear steiner trees: Efficient special-case algorithms
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+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 @@
+On Steiner Minimal Trees with Rectilinear Distance
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for suboptimal rectilinear Steiner trees
+Normal rank
@@ Property / cites work @@
+A fast algorithm for Steiner trees
@@ Property / cites work: A fast algorithm for Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank