Fast algorithms for approximating distances
In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].
approximation algorithms distance selection problem well-separated pair decomposition