Show simple item record

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorCases Muñoz, Rafel
dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorPetit Silvestre, Jordi
dc.contributor.authorSerna Iglesias, María José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationAlvarez, C., Cases, R., Diaz, J., Petit, J., Serna, M. "Communication tree problems". 2001.
dc.description.abstractIn 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.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherCommunication tree problems
dc.titleCommunication tree problems
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorAlvarez, C., Cases, R., Diaz, J., Petit, J., Serna, M.

Files in this item


This item appears in the following Collection(s)

Show simple item record

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