Communication tree problems

Authors:
Carme Àlvarez;Rafel Cases;Josep Díaz;Jordi Petit;Maria Serna
Affiliations:
ALBCOM Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Edifici , Campus Nord, c/Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;ALBCOM Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Edifici , Campus Nord, c/Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;ALBCOM Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Edifici , Campus Nord, c/Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;ALBCOM Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Edifici , Campus Nord, c/Jordi Girona Salgado 1-3, 08034 Barcelona, Spain;ALBCOM Research Group, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Edifici , Campus Nord, c/Jordi Girona Salgado 1-3, 08034 Barcelona, Spain
Venue:
Theoretical Computer Science
Year:
2007

Citing 11
Cited 0

Constrained optimum communication trees and sensitivity analysis

SIAM Journal on Computing
Introduction to algorithms

Introduction to algorithms
Compressions and isoperimetric inequalities

Journal of Combinatorial Theory Series A
Randomized algorithms

Randomized algorithms
Some results on tree decomposition of graphs

Journal of Graph Theory
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Approximating layout problems on random geometric graphs

Journal of Algorithms
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of embedding graphs into binary trees

FCT '85 Fundamentals of Computation Theory
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we deal with the problem of constructing optimal communication trees satisfying given communication requirements. We consider two constant degree tree communication models and several cost measures. First, we analyze whether a tree selected at random provides a good randomized approximation algorithm, and we show that such a construction fails for some of the measures. Secondly, we provide approximation algorithms for the case in which the communication requirements are given by a random graph in two different random models, namely the classical G"n","p and random geometric graphs. Finally, we conclude with some open problems.