A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565): 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.1016/j.ipl.2010.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2054665259
@@ Property / OpenAlex ID: W2054665259 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved LP-based approximation for steiner tree
+Normal rank
@@ Property / cites work @@
+On the Full and Bottleneck Full Steiner Tree Problems
+Normal rank
@@ Property / cites work @@
+On approximation algorithms for the terminal Steiner tree problem
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+A note on the terminal Steiner tree problem
@@ Property / cites work: A note on the terminal Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+On the terminal Steiner tree problem.
@@ Property / cites work: On the terminal Steiner tree problem. / rank @@
+Normal rank
@@ Property / cites work @@
+The full Steiner tree problem
@@ Property / cites work: The full Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for terminal Steiner trees
@@ Property / cites work: Algorithms for terminal Steiner trees / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank