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>^<i>d</i> 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

View on ACM

cs.duke.edu

Save to Library

Create Alert

Cite

Launch Research Feed