What is the algorithm for enclosing at least m points out of n given points in smallest circle?
Given N points on the 2D real plane, what is the most efficient algorithm to find the most number of points that lie on any one circle?