# On the intercluster and inner-cluster distances of a tree

@inproceedings{Wu2006OnTI, title={On the intercluster and inner-cluster distances of a tree}, author={Bang Ye Wu}, year={2006} }

For two vertex clusters of a tree metric, we show that the sum of the average inner-cluster 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. Generalization to… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

## Approximation algorithms for the optimal p-source communication spanning tree

VIEW 1 EXCERPT

## Spanning trees and optimization problems

VIEW 1 EXCERPT

## Exact algorithms for minimum routing cost trees

VIEW 1 EXCERPT

## Multisource spanning tree problems

VIEW 1 EXCERPT