A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061): Difference between revisions

@@ Property / cites work @@
+Improved Approximations for the Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+Approximations for Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Improved methods for approximating node weighted Steiner trees and connected dominating sets.
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+Steiner tree problem with minimum number of Steiner points and bounded edge-length
+Normal rank
@@ Property / cites work @@
+Low-degree minimum spanning trees
@@ Property / cites work: Low-degree minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Bottleneck Steiner trees in the plane
@@ Property / cites work: Bottleneck Steiner trees in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+An 11/6-approximation algorithm for the network Steiner problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(00)00095-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2087989351
@@ Property / OpenAlex ID: W2087989351 / rank @@
+Normal rank