Abstract
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].
Original language | English |
---|---|
Pages (from-to) | 263-269 |
Number of pages | 7 |
Journal | Algorithmica |
Volume | 33 |
Issue number | 2 |
DOIs | |
State | Published - 1 Jan 2002 |
Keywords
- Approximation algorithms
- Distance selection problem
- Well-separated pair decomposition
ASJC Scopus subject areas
- General Computer Science
- Computer Science Applications
- Applied Mathematics