post office problem

(algorithm)   Given a set of points (in N dimensions), find another point which minimises the sum of the distances from that point to each of the others.

Last updated: 2007-03-07


Loading