Communication tree problems

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/97656

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Álvarez Faura, M. del Carme
dc.contributor.author	Cases Muñoz, Rafel
dc.contributor.author	Díaz Cort, Josep
dc.contributor.author	Petit Silvestre, Jordi
dc.contributor.author	Serna Iglesias, María José
dc.date	2001-03
dc.identifier.citation	Alvarez, C., Cases, R., Diaz, J., Petit, J., Serna, M. "Communication tree problems". 2001.
dc.identifier.uri	http://hdl.handle.net/2117/97656
dc.language.iso	eng
dc.relation	LSI-01-10-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject	Communication tree problems
dc.title	Communication tree problems
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.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.