Learn More
Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnega-tive vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changing the vertex weights at minimum cost such that a prespecified vertex becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding weight. We show that(More)