There are $n<10^4$ points on the plane. How can one approximately (with a given precision $2^{-20}$ of points' coordinates) find the minimal radius of a circle that covers some $k$ out of $n$ these points?There is lots of information on the case $k=n$ in Wikipedia, but I found nothing on general case.
Minimal covering circle
algorithms;computational geometry