Approximate minimum enclosing balls in high dimensions using core-sets (original) (raw)
Related papers
Computing Core-Sets and Approximate Smallest Enclosing HyperSpheres in High Dimensions
Two Algorithms for the Minimum Enclosing Ball Problem
SIAM Journal on Optimization, 2008
Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
Siam Journal on Optimization, 2008
An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem
INFORMS Journal on Computing, 2009
A dual algorithm for the minimum covering ball problem in
Operations Research Letters, 2009
Minimum-Volume Enclosing Ellipsoids and Core Sets
Journal of Optimization Theory and Applications, 2005
2020
Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope
Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06, 2006
A dual algorithm for the minimum covering weighted ball problem in {\mathbb{R}^n}$$
Journal of Global Optimization, 2013
Optimization Letters, 2012
Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
Automata, Languages and Programming, 2011
Approximating smallest enclosing disks
2004
Locating minimal sets using polyhedral cones
Operations Research Letters, 2011
New Sphere Methods for Linear Programs
Decision Technologies and Applications, 2009
A finite exact algorithm for epsilon-core membership in two dimensions
2010
A Smoothing Algorithm for the Smallest Intersecting Ball Problem
2013
Efficient subspace approximation algorithms
Proceedings of the eighteenth …, 2007
Greedy Geometric Optimization Algorithms for Collection of Balls
A Composable Coreset for k-Center in Doubling Metrics
ArXiv, 2018
Coresets and Sketches for High Dimensional Subspace Approximation Problems
Morteza Monemizadeh, Dan Feldman
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2016
Fast approximation of convex hull
2006
Applications of Convex Analysis to the Smallest Intersecting Ball Problem
Arxiv preprint arXiv:1105.2132, 2011
An Algorithm for Computing the Minimum Covering Sphere in Any Dimension
1989
4 Robust Proximity Search for Balls using Sublinear Space∗
2014
Minimax and maximin fitting of geometric objects to sets of points
2011
Simpler core vector machines with enclosing balls
Proceedings of the 24th international …, 2007
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
Computer-Aided Design, 2011
Almost optimal set covers in finite VC-dimension
Discrete & Computational Geometry, 1995
Computational Geometry and Linear Programming(Computational Geometry and Discrete Geometry)
1994
Largest Inscribed Ball and Minimal Enclosing Box for Convex Maximization Problems
Guillaume Guérard, Ider Tseveendorj
Instance-optimal geometric algorithms
2009 50th Annual IEEE Symposium …, 2009