Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264): Difference between revisions

@@ Property / cites work @@
+Improved Approximations for the Steiner Tree Problem
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+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 @@
+A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
+Normal rank
@@ Property / cites work @@
+New approximation algorithms for the Steiner tree problems
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+The computation of nearly minimal Steiner trees in graphs
+Normal rank
@@ Property / cites work @@
+Q3874241
@@ Property / cites work: Q3874241 / rank @@
+Normal rank
@@ Property / cites work @@
+An 11/6-approximation algorithm for the network Steiner problem
+Normal rank