A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170): Difference between revisions

@@ Property / cites work @@
+Optimum Communication Spanning Trees
@@ Property / cites work: Optimum Communication Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the network design problem
@@ Property / cites work: The complexity of the network design problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Strongly Polynomial Minimum Cost Flow Algorithm
+Normal rank
@@ Property / cites work @@
+PTAS’s for Some Metric p-source Communication Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+A tight bound on approximating arbitrary metrics by tree metrics
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
+Normal rank
@@ Property / cites work @@
+Spanning Trees and Optimization Problems
@@ Property / cites work: Spanning Trees and Optimization Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some optimum communication spanning tree problems
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank