Communication tree problems

DOI10.1016/J.TCS.2007.04.038MaRDI QIDQ995575zbMATH OpenOpenAlexFDO

Authors Carme Àlvarez, Rafel Cases, Jordi Petit, J. Díaz, Maria Serna

Publication date 3 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/97656

zbMATH Keywords

approximation algorithmsrandom graphstree layoutcommunication tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem
• Constrained Optimum Communication Trees and Sensitivity Analysis
• Approximation algorithms for some optimum communication spanning tree problems
• A minimax assignment problem in treelike communication networks
• Algorithms for the optimum communication spanning tree problem

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3945345 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1857648 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• A variation on the min cut linear arrangement problem
• Approximating layout problems on random geometric graphs
• Approximating layout problems on random graphs
• Call routing and the ratcatcher
• Compressions and isoperimetric inequalities
• Constrained Optimum Communication Trees and Sensitivity Analysis
• Optimum Communication Spanning Trees
• Some results on tree decomposition of graphs
• The complexity of the network design problem

Cited in

(1)

• A communication problem and directed triple systems

This page was built for publication: Communication tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995575)