Introduction to algorithms
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics
Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics
The complexity of minimizing certain cost metrics for k-source spanning trees
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
MAD Trees and distance-hereditary graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A linear-time algorithm to compute a MAD tree of an interval graph
Information Processing Letters
Approximation algorithms for the optimal p-source communication spanning tree
Discrete Applied Mathematics
Average distance in colored graphs
Journal of Graph Theory
A new segmentation approach in structured self-organizing maps for image retrieval
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
| Hi-index | 5.23 |
For two vertex clusters of a tree metric, we show that the sum of the average intracluster distances is always less than or equal to twice of the average intercluster distance. We show the feature in a more general form of weighted distance. This feature provides a 2-approximation algorithm for the minimum average intercluster distance spanning tree problem, which is a generalization of the minimum routing cost spanning tree or minimum average distance spanning tree problem. The results in this paper can be further generalized to more than two clusters.