@InProceedings{bohm_et_al:LIPIcs.MFCS.2020.18,
author = {B\"{o}hm, Martin and Hoeksma, Ruben and Megow, Nicole and N\"{o}lke, Lukas and Simon, Bertrand},
title = {{Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.18},
URN = {urn:nbn:de:0030-drops-126870},
doi = {10.4230/LIPIcs.MFCS.2020.18},
annote = {Keywords: k-hop Steiner tree, dynamic programming, bounded treewidth}
}