Proximity Algorithms for Nearly-Doubling Spaces

We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has doubling dimension at most d . We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.

• Type: Conference
• Year: 2010
• Where: APPROX
• Authors: Lee-Ad Gottlieb, Robert Krauthgamer
• Keywords: Algorithms, APPROX 2010, Bicriteria Approximation, Fewest Number, Target Dimension