494 research outputs found
Computing a Minimum-Cost -hop Steiner Tree in Tree-Like Metrics
We consider the problem of computing a Steiner tree of minimum cost under a
-hop constraint which requires the depth of the tree to be at most . Our
main result is an exact algorithm for metrics induced by graphs of bounded
treewidth that runs in time . For the special case of a path, we give
a simple algorithm that solves the problem in polynomial time, even if is
part of the input. The main result can be used to obtain, in quasi-polynomial
time, a near-optimal solution that violates the -hop constraint by at most
one hop for more general metrics induced by graphs of bounded highway
dimension
- …