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.

In addition suitable contents:
[ an ] [ at ] [ ch ] [ er ] [ es ] [ et ] [ fi ] [ fr ] [ G ] [ h ] [ hat ] [ in ] [ int ] [ io ] [ is ] [ N ] [ nc ] [ ni ] [ no ] [ ns ] [ om ] [ point ] [ ro ] [ se ] [ set ] [ si ] [ st ] [ su ] [ sum ] [ th ] [ to ] [ um ] [ ve ]