On the intercluster distance of a tree metric (Q861256): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.07.056
+Normal rank
@@ Property / OpenAlex ID @@
+W2043721202
@@ Property / OpenAlex ID: W2043721202 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
+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 @@
+A linear-time algorithm to compute a MAD tree of an interval graph
+Normal rank
@@ Property / cites work @@
+Average distance in colored graphs
@@ Property / cites work: Average distance in colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4882555
@@ Property / cites work: Q4882555 / 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 @@
+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 @@
+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 @@
+Approximation algorithms for the optimal \(p\)-source communication spanning tree
+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 @@
+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