Minimizing and Computing the Inverse Geodesic Length on Trees

Serge Gaspers, Joshua Lau

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ v…