| Article ID: | iaor20121009 |
| Volume: | 33 |
| Issue: | 2 |
| Start Page Number: | 263 |
| End Page Number: | 269 |
| Publication Date: | Jun 2002 |
| Journal: | Algorithmica |
| Authors: | Bespamyatnikh S, Segal M |
| Keywords: | approximation, decomposition |
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].