An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+Steiner tree problem with minimum number of Steiner points and bounded edge-length
+Normal rank
@@ Property / cites work @@
+A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
+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 @@
+Approximations for a bottleneck Steiner tree problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00209-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2148678019
@@ Property / OpenAlex ID: W2148678019 / rank @@
+Normal rank