Optimal core-sets for balls

@article{Badoiu2008OptimalCF,
  title={Optimal core-sets for balls},
  author={Mihai Badoiu and K. Clarkson},
  journal={Comput. Geom.},
  year={2008},
  volume={40},
  pages={14-22}
}
  • Mihai Badoiu, K. Clarkson
  • Published 2008
  • Computer Science, Mathematics
  • Comput. Geom.
  • Given a set of points [email protected]?R^d and value @e>0, an @[email protected]?P has the property that the smallest ball containing S has radius within [email protected] of the radius of the smallest ball containing P. This paper shows that any point set has an @e-core-set of size @?1/@[email protected]?, and this bound is tight in the worst case. Some experimental results are also given, comparing this algorithm with a previous one, and with a more powerful, but slower one. 
    174 Citations
    Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
    • 18
    • Highly Influenced
    • PDF
    Complexity and approximation of the Smallest k-Enclosing Ball problem
    • 7
    Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions
    • 13
    • PDF
    Streaming Algorithms for Extent Problems in High Dimensions
    • 50
    • PDF
    Minimum Enclosing Ball Revisited: Stability and Sub-linear Time Algorithms
    • Hu Ding
    • Mathematics, Computer Science
    • ArXiv
    • 2019
    • 1
    • PDF
    Core-Sets: Updated Survey
    Approximation algorithms for color spanning diameter
    • 3
    Coresets for polytope distance
    • 62
    • PDF
    An External Memory Algorithm for the Minimum Enclosing Ball Problem
    • 1
    • PDF

    References

    SHOWING 1-7 OF 7 REFERENCES
    Approximate minimum enclosing balls in high dimensions using core-sets
    • 163
    • PDF
    Smaller core-sets for balls
    • 173
    • PDF
    Approximate clustering via core-sets
    • 409
    • PDF
    Reductions among high dimensional proximity problems
    • 73
    • PDF
    The John Ellipsoid Theorem
    • 10
    • PDF
    Projective clustering in high dimensions using core-sets
    • 87
    • PDF
    Approximate clustering via core-sets The John Ellipsoid Theorem
    • Proceedings of the 34th Symposium on Theory of Computing
    • 1997