Additive Approximation Algorithm for k-Geodesic Center in δ-Hyperbolic Graphs

The authors provide an additive O(δ)-approximation algorithm for the k-Geodesic Center problem on δ-hyperbolic graphs, where the goal is to find a set of k isometric paths that minimizes the maximum distance between any vertex and the set of paths.