On hop-constrained steiner trees in tree-like metrics
We consider the problem of computing a Steiner tree of minimum cost under a hop
constraint that requires the depth of the tree to be at most k. Our main result is an exact …
constraint that requires the depth of the tree to be at most k. Our main result is an exact …
A PTAS for -hop MST on the Euclidean plane: Improving Dependency on
J Fakcharoenphol, N Wongwattanakij - arXiv preprint arXiv:2106.11092, 2021 - arxiv.org
For any $\epsilon> 0$, Laue and Matijevi\'{c}[CCCG'07, IPL'08] give a PTAS for finding a
$(1+\epsilon) $-approximate solution to the $ k $-hop MST problem in the Euclidean plane …
$(1+\epsilon) $-approximate solution to the $ k $-hop MST problem in the Euclidean plane …