A location problem on network

In this article we considered a kind of new location problem, The problem is to determine a path on the network to minimize the total weighted distance from it to n given point on the network. It is proved that the problem is NP-complete. When the network is a tree, The problem is solved by polynomial-time algorithm, this algorithm complexity is O (n
²
), then some approximate methods based on tree's situation are designed.