An O(mnlogn) algorithm is proposed to determine a point of a network with m arcs and n vertices which minimizes the variance of the weighted distances to all vertices.
