The inverse 1-median problem on star graphs

In this paper, we mainly discuss the inverse 1-median problem on star graphs with non-negative edge lengths and positive vertex weights. The inverse 1-median problem considered in this paper is to change the edge lengths at the minimum cost so that a given vertex becomes the 1-median of the network. We show that this problem can be solved efficiently in O(n) time.