The Minimum Covering Sphere Problem

Cited In (44)

Approximate minimum enclosing balls in high dimensions using core-sets
Saddle points and overdetermined complex equations
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
The 1-center problem in the plane with independent random weights
Local Gathering of Mobile Robots in Three Dimensions
An efficient algorithm for the smallest enclosing ball problem in high dimensions
Location of rectilinear center trajectories
Approximations of differentiable convex functions on arbitrary convex polytopes
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
Duality results for extended multifacility location problems
Duality results for nonlinear single minimax location problems via multi-composed optimization
Chebyshev approximation of a point set by a straight line
A new algorithm for the minimax location problem with the closest distance
Weight bound constraints in mean-variance models: a robust control theory foundation via machine learning
Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas
Quality locations for the constrained minimax location model
An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
Special issue on Locational analysis
Chebyshev centres, Jung constants, and their applications
Generalised entropy of curves for the analysis and classification of dynamical systems
Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
On the ‘most normal’ normal
A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem
Solving general continuous single facility location problems by cutting planes
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
Moment inequalities for random variables in computational geometry
Efficient algorithms for the smallest enclosing ball problem
A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
Title not available (Why is that?)
Unifying gathering protocols for swarms of mobile robots
Explizite Lösung des dreidimensionalen Minimax-Standortproblems in der City-Block-Distanz
Continuous Center Problems
On the covering multiplicity of lattices
A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
Optimal scaling of balls and polyhedra
On the planar piecewise quadratic 1-center problem
On the elimination of inessential points in the smallest enclosing ball problem
A bird's eye-view of min-max and max-min functionals
Normative location theory: Placement in continuous space
An efficient cutting plane algorithm for the smallest enclosing circle problem

This page was built for publication: The Minimum Covering Sphere Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653823)