A new template for solving p-Median problems for trees in sub-quadratic time

Abstract

We propose an O(n logp+2 n) algorithm for solving the well-known p-Median problem for trees. Our analysis relies on the fact that p is considered constant (in practice, very often p ≪ n). This is the first result in almost 25 years that proposes a new algorithm for solving this problem, opening up several new avenues for research. © Springer-Verlag Berlin Heidelberg 2005.