Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

@inproceedings{Krivosija2019ProbabilisticSE,
  title={Probabilistic smallest enclosing ball in high dimensions via subgradient sampling},
  author={Amer Krivosija and Alexander Munteanu},
  booktitle={Symposium on Computational Geometry},
  year={2019}
}
  • Amer Krivosija, Alexander Munteanu
  • Published in
    Symposium on Computational…
    2019
  • Mathematics, Computer Science
  • We study a variant of the median problem for a collection of point sets in high dimensions. This generalizes the geometric median as well as the (probabilistic) smallest enclosing ball (pSEB) problems. Our main objective and motivation is to improve the previously best algorithm for the pSEB problem by reducing its exponential dependence on the dimension to linear. This is achieved via a novel combination of sampling techniques for clustering problems in metric spaces with the framework of… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 46 REFERENCES
    High-Dimensional Computational Geometry
    119
    epsilon-Kernel Coresets for Stochastic Points
    12
    Stochastic k-Center and j-Flat-Center Problems
    9
    Approximate clustering via core-sets
    388
    Optimal core-sets for balls
    173