Connected P-median Problems in Tree Networks
Shouwei Li · Journal of Hangzhou Dianzi University · 2009
Given a connected graph,there is a nonnegative weight for every vertex and edge.The general-median problem of this graph is to find a subset with vertices and such that the sum of weighted distance from every vertex tois minimum.If the induced subgraph of is connected,then we call the problem as connected-median problem.We study the connected-median problems in tree networks,an algorithm is presented.We then generalize this algorithm to the situation with some forbidden vertices.