We provide a quasilinear time algorithm for the p-center problem with an additive error less than or equal to 3 times the input graph’s hyperbolic constant. Specifically, for the graph G = (V,E) with n vertices, m edges and hyperbolic constant δ, we construct an algorithm for p-centers in time O(p(δ + 1)(n + m) log(n)) with radius not exceeding rp + δ when p ≤ 2 and rp + 3δ when p ≥ 3, where rp...