Approximate minimum enclosing balls in high dimensions using core-sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1810276 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2079414 (Why is no real title available?)
- A mathematical view of interior-point methods in convex optimization
- Algorithms - ESA 2003
- An efficient, exact, and generic quadratic programming solver for geometric optimization
- Applications of second-order cone programming
- Approximate clustering via core-sets
- Approximating the diameter of a set of points in the Euclidean space
- Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
- Choosing multiple parameters for support vector machines
- Extensions of Lipschitz mappings into a Hilbert space
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Randomized combinatorial algorithms for linear programming when the dimension is moderately high
- Reductions among high dimensional proximity problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Solution methodologies for the smallest enclosing circle problem
- Solving semidefinite-quadratic-linear programs using SDPT3
- The Minimum Covering Sphere Problem
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Warm-start strategies in interior-point methods for linear programming
Cited in
(42)- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- An SMO-type method for solving the MEB problem
- Minimal containment under homothetics: a simple cutting plane approach
- Practical methods for shape fitting and kinetic data structures using coresets
- New algorithms for \(k\)-center and extensions
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- No dimension independent core-sets for containment under homothetics
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- A new algorithm for the minimax location problem with the closest distance
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Static and streaming data structures for Fréchet distance queries
- Minimum-volume enclosing ellipsoids and core sets
- On a minimum enclosing ball of a collection of linear subspaces
- On approximating the Riemannian 1-center
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Computing minimum-volume enclosing axis-aligned ellipsoids
- Approximating covering and minimum enclosing balls in hyperbolic geometry
- On approximability of minimum color-spanning ball in high dimensions
- Algorithms - ESA 2003
- New approximation algorithms for minimum enclosing convex shapes
- On the string consensus problem and the Manhattan sequence consensus problem
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- 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
- Optimal core-sets for balls
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Adaptation based on generalized discrepancy
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- No dimension-independent core-sets for containment under homothetics
- Two Algorithms for the Minimum Enclosing Ball Problem
- Multi-view L2-SVM and its multi-view core vector machine
- Scalable learning method for feedforward neural networks using minimal-enclosing-ball approximation
- Streaming algorithms for extent problems in high dimensions
- Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
This page was built for publication: Approximate minimum enclosing balls in high dimensions using core-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463443)
