## 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

(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

Updated: Mon Sep 26 19:50:21 2016

14873 terms

No longer supported by Imperial College Department of Computing

Tweet