ALCOMFT-TR-01-137

C. \`Alvarez, R. Cases, J. D\'\iaz, J. Petit and M. Serna
Communication tree problems
Barcelona. Work package 2. June 2001.

Abstract: In this paper, we consider random communication requirements and several cost measures for a particular model of tree routing on a complete network. First we show that a random tree does not give any approximation. Then give approximation algorithms for the case for two random models of requirements.

Postscript file: ALCOMFT-TR-01-137.ps.gz (194 kb).