title: algorithm to find a point among n points in plane to minimize the sum of distances
body: <p>I have an algorithm problem here. It is different from the normal <a href="http://en.wikipedia.org/wiki/Fermat_point" rel="noreferrer">Fermat Point problem</a>.</p>
  
  <p>Given a set of <code>n</code> points in the plane, I need to find which one can minimize the sum of distances to the rest of <code>n-1</code> points.</p>
  
  <p>Is there any algorithm you know of run less than O(n^2)? </p>
  
  <p>Thank you.</p>