Reverse 2-median problem on trees Original Research Article

This paper concerns the reverse 2-median problem on trees and the reverse 1-median problem on graphs that contain exactly one cycle. It is shown that both models under investigation can be transformed to an equivalent reverse 2-median problem on a path. For this new problem an image algorithm is proposed, where n is the number of vertices of the path. It is also shown that there exists an integral solution if the input data are integral.