Query Complexity of the Metric Steiner Tree Problem
Query Complexity of the Metric Steiner Tree Problem
In the metric Steiner Tree problem, we are given an n × n metric w on a set V of vertices along with a set T ⊆ V of k terminals, and the goal is to find a tree of minimum cost that contains all terminals in T. This is …