Abstract
Let a connected undirected graph G = (V, E) be given. In the classical p-median problem we want to find a set X containing p points in G such that the sum of weighted distances from X to all vertices in V is minimized. We consider the semi-obnoxious case where every vertex has either a positive or negative weight. In this case we have two different objective functions: the sum of the minimum weighted distances from X to all vertices and the sum of the weighted minimum distances. In this paper we show that for the case p = 3 an optimal solution for the second model in a tree can be found in O(n5) time. If the 3-median is restricted to vertices or if the tree is a path then the complexity can be reduced to O(n3).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have