A polynomial algorithm for the two-connections variant of the tree p-median problem

We consider the variant of the tree $p$-median problem where each node must be connected to the two closest centers. This problem is polynomially solved through a dynamic programming formulation that extends the solution given by A. Tamir for the classical$p$-median problem on a tree.