Communication tree problems
From MaRDI portal
Publication:995575
DOI10.1016/J.TCS.2007.04.038zbMATH Open1188.68354OpenAlexW1981869853MaRDI QIDQ995575FDOQ995575
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Call routing and the ratcatcher
- A Separator Theorem for Planar Graphs
- Title not available (Why is that?)
- Compressions and isoperimetric inequalities
- The complexity of the network design problem
- Optimum Communication Spanning Trees
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- Approximating layout problems on random geometric graphs
- Title not available (Why is that?)
- A variation on the min cut linear arrangement problem
- Some results on tree decomposition of graphs
- Approximating layout problems on random graphs
- Constrained Optimum Communication Trees and Sensitivity Analysis
- Title not available (Why is that?)
Cited In (1)
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)
