Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
From MaRDI portal
Publication:2954999
DOI10.4230/LIPIcs.STACS.2015.238zbMath1355.68204arXiv1409.6551MaRDI QIDQ2954999
Markus Chimani, Joachim Spoerhase
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1409.6551
Related Items
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics, On Hop-Constrained Steiner Trees in Tree-Like Metrics