Communication tree problems
View/Open
Cita com:
hdl:2117/97656
Document typeResearch report
Defense date2001-03
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
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.
CitationAlvarez, C., Cases, R., Diaz, J., Petit, J., Serna, M. "Communication tree problems". 2001.
Is part ofLSI-01-10-R
Collections
Files | Description | Size | Format | View |
---|---|---|---|---|
R01-10.pdf | 355,6Kb | View/Open |