Two Algorithms for the Minimum Enclosing Ball Problem
From MaRDI portal
Recommendations
Cited in
(33)- Solving \(k\)-center problems involving sets based on optimization techniques
- Approximate maximum rank aggregation: beyond the worst-case
- Approximate minimum enclosing balls in high dimensions using core-sets
- On the hardness of the consensus string problem
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- Optimization algorithms for faster computational geometry
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Approximating fair \(k\)-min-sum-radii in Euclidean space
- A new algorithm for the minimax location problem with the closest distance
- Chebyshev centres, Jung constants, and their applications
- On a minimum enclosing ball of a collection of linear subspaces
- On approximating the Riemannian 1-center
- A faster dual algorithm for the Euclidean minimum covering ball problem
- New approximation algorithms for minimum enclosing convex shapes
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
- Fast algorithms for the minimum volume estimator
- PolyCD: optimization via cycling through the vertices of a polytope
- The MDM algorithm and the Sylvester problem
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- A reformulation-linearization based algorithm for the smallest enclosing circle problem
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
- Optimal core-sets for balls
- Two-string consensus problem under non-overlapping inversion and transposition distance
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Adaptation based on generalized discrepancy
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- On the elimination of inessential points in the smallest enclosing ball problem
- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball
- Minimizing the size of the uncertainty regions for centers of moving entities
This page was built for publication: Two Algorithms for the Minimum Enclosing Ball Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395020)
