An Efficient Algorithm for 2D Euclidean 2-Center with Outliers


For a set P of n points in R, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P . We extend this to the (2, k)-center problem where we compute the minimal radius pair of congruent disks to cover n − k points of P . We present a randomized algorithm with O(nk log n) expected running time for the (2, k… (More)
DOI: 10.1007/978-3-540-87744-8_6


6 Figures and Tables

Slides referencing similar topics