Corpus ID: 20623376

Smaller core-sets for balls

@inproceedings{Badoiu2003SmallerCF,
  title={Smaller core-sets for balls},
  author={Mihai Badoiu and K. Clarkson},
  booktitle={SODA '03},
  year={2003}
}
  • Mihai Badoiu, K. Clarkson
  • Published in SODA '03 2003
  • Mathematics, Computer Science
  • Given a set of points <i>P</i> ⊂ <i>R</i><sup><i>d</i></sup> and value ∊ > 0, an ∊-core-set <i>S</i> ⊂ <i>P</i> has the property that the smallest ball containing <i>S</i> is an ∊-approximation of the smallest ball containing <i>P</i>. This paper shows that any point-set has an ∊-core-set of size [2/∊]. We also give a fast algorithm that finds this core-set. These results imply the existence of small core-sets for solving approximate <i>k</i>-center clustering and related problems. The sizes of… CONTINUE READING
    173 Citations

    Topics from this paper

    Approximating extent measures of points
    • 332
    • PDF
    High-dimensional shape fitting in linear time
    • 4
    • PDF
    Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
    • 345
    • PDF
    Sampling algorithms and coresets for ℓp regression
    • 136
    • PDF
    Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope
    • 10
    • PDF
    Dynamic coresets
    • T. Chan
    • Mathematics, Computer Science
    • SCG '08
    • 2008
    • 22
    Clustering in High Dimensions
    • PDF
    Streaming with minimum space: An algorithm for covering by two congruent balls
    • 3
    Optimal core-sets for balls
    • 175
    • PDF
    The smallest enclosing ball of balls: combinatorial structure and algorithms
    • 51
    • PDF