Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+MAD trees and distance-hereditary graphs
@@ Property / cites work: MAD trees and distance-hereditary graphs / 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 @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for some optimum communication spanning tree problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(03)00262-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1991032379
@@ Property / OpenAlex ID: W1991032379 / rank @@
+Normal rank