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

Philippe Chrétienne (1)

1 RO - Recherche Opérationnelle

We consider the variant of the tree pp-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.

Mots clés: Location; Dynamic programming; pp-median problem

Domaines: Algorithme et structure de données [cs.DS]

Philippe Chrétienne. A polynomial algorithm for the two-connections variant of the tree pp-median problem. Discrete Optimization, 2014, 14, pp.1-16. ⟨10.1016/j.disopt.2014.06.001⟩. ⟨hal-01366537⟩