Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286): 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.1007/978-3-319-18263-6_9
+Normal rank
@@ Property / OpenAlex ID @@
+W572952093
@@ Property / OpenAlex ID: W572952093 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Approximations for Steiner trees with minimum number of Steiner points
+Normal rank
@@ Property / cites work @@
+A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
+Normal rank
@@ Property / cites work @@
+On better heuristics for Steiner minimum trees
@@ Property / cites work: On better heuristics for Steiner minimum trees / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Q4194048
@@ Property / cites work: Q4194048 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Survivable Networks with Minimum Number of Steiner Points
+Normal rank
@@ Property / cites work @@
+Relay placement for fault tolerance in wireless networks in higher dimensions
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Uniform Connectivity Problems
+Normal rank
@@ Property / cites work @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+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 @@
+Wireless network design via 3-decompositions
@@ Property / cites work: Wireless network design via 3-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Low-degree minimum spanning trees
@@ Property / cites work: Low-degree minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+An 11/6-approximation algorithm for the network Steiner problem
+Normal rank