THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
From MaRDI portal
Recommendations
Cites work
- A Subexponential Algorithm for Abstract Optimization Problems
- A subexponential bound for linear programming
- Approximate clustering via core-sets
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On the ball spanned by balls
- Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
- Solution methodologies for the smallest enclosing circle problem
Cited in
(25)- Solving \(k\)-center problems involving sets based on optimization techniques
- A limited memory BFGS algorithm for the smallest enclosing ball problem
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Algorithms for determining relative position between spheroids and hyperboloids with one sheet
- Covering convex polygons by two congruent disks
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Covering convex polygons by two congruent disks
- Smallest enclosing ball for probabilistic data
- Counting unique-sink orientations
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- On the smallest enclosing balls
- A new algorithm for the minimax location problem with the closest distance
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Exact primitives for smallest enclosing ellipses
- On a minimum enclosing ball of a collection of linear subspaces
- Miniball
- Combinatorial generalizations of Jung's theorem
- Unique sink orientations of grids
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- Random sampling with removal
- scientific article; zbMATH DE number 6487863 (Why is no real title available?)
- On the ball spanned by balls
- Computational Science and Its Applications – ICCSA 2004
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
This page was built for publication: THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824662)
