A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453): Difference between revisions

@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+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 @@
+The Steiner tree problem
@@ Property / cites work: The Steiner tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234152
@@ Property / cites work: Q4234152 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+A faster approximation algorithm for the Steiner problem in graphs
+Normal rank
@@ Property / cites work @@
+Cost-minimal trees in directed acyclic graphs
@@ Property / cites work: Cost-minimal trees in directed acyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The rectilinear Steiner arborescence problem
@@ Property / cites work: The rectilinear Steiner arborescence problem / rank @@
+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 @@
+Worst-case performance of Rayward-Smith's Steiner tree heuristic
+Normal rank
@@ Property / cites work @@
+An 11/6-approximation algorithm for the network Steiner problem
+Normal rank