Dynamic programming based heuristics for the topological design of local access networks (Q1179743): Difference between revisions

@@ Property / cites work @@
+Heuristics with Constant Error Guarantees for the Design of Tree Networks
+Normal rank
@@ Property / cites work @@
+The Capacitated Minimum Spanning Tree
@@ Property / cites work: The Capacitated Minimum Spanning Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
+Normal rank
@@ Property / cites work @@
+A New Class of Algorithms for Multipoint Network Optimization
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The complexity of the capacitated tree problem
@@ Property / cites work: The complexity of the capacitated tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q5622261
@@ Property / cites work: Q5622261 / rank @@
+Normal rank