On the minimum routing cost clustered tree problem (Q2359809): Difference between revisions

@@ Property / cites work @@
+An improved approximation algorithm for the clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Finding best swap edges minimizing the routing cost of a spanning tree
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for somek-source shortest paths spanning tree problems
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to compute a MAD tree of an interval graph
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized network design problems.
@@ Property / cites work: Generalized network design problems. / rank @@
+Normal rank
@@ Property / cites work @@
+Exact algorithms for minimum routing cost trees
@@ Property / cites work: Exact algorithms for minimum routing cost trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The checkpoint problem
@@ Property / cites work: The checkpoint problem / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Approximation of Minimum Routing Cost Trees
+Normal rank
@@ Property / cites work @@
+A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+PTAS’s for Some Metric p-source Communication Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+A two-patch model for the optimal management of a fishing resource considering a marine protected area
+Normal rank
@@ Property / cites work @@
+Worst-Case Analysis of Network Design Problem Heuristics
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
+Normal rank
@@ Property / cites work @@
+On the intercluster distance of a tree metric
@@ Property / cites work: On the intercluster distance of a tree metric / rank @@
+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 the shortest total path length spanning tree problem
+Normal rank
@@ Property / cites work @@
+Light graphs with small routing cost
@@ Property / cites work: Light graphs with small routing cost / rank @@
+Normal rank
@@ Property / cites work @@
+The swap edges of a multiple-sources routing tree
@@ Property / cites work: The swap edges of a multiple-sources routing tree / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
+Normal rank
@@ Property / cites work @@
+On the clustered Steiner tree problem
@@ Property / cites work: On the clustered Steiner tree problem / rank @@
+Normal rank