A polynomial algorithm for the two-connections variant of the tree pp-median problem - Archive ouverte HAL Access content directly
Journal Articles Discrete Optimization Year : 2014

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

Philippe Chrétienne
  • Function : Author
  • PersonId : 968920

Abstract

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.

Dates and versions

hal-01366537 , version 1 (14-09-2016)

Identifiers

Cite

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⟩
47 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More