An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071): Difference between revisions

@@ Property / cites work @@
+The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ 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 @@
+Q2752462
@@ Property / cites work: Q2752462 / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-source spanning trees: Algorithms for minimizing source eccentricities.
+Normal rank
@@ Property / cites work @@
+Undirected single-source shortest paths with positive integer weights in linear time
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the optimal \(p\)-source communication spanning tree
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the shortest total path length spanning tree problem
+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