G. Ducoffe

Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs

The Weighted Center} problem takes as its input a graph $G=(V,E)$ together with a profile $\pi$ such that every vertex $v$ is mapped to some nonnegative multiplicative weight $\pi(v)$. Its output must be some vertex $c$ minimizing $\max\{\pi(v)d_G(c,v) : v \in V\}$. The classic Center problem corresponds to the case wh...