Algorithms - ESA 2003
From MaRDI portal
Publication:5897282
DOI10.1007/B13632zbMATH Open1266.68190OpenAlexW1827234103MaRDI QIDQ5897282FDOQ5897282
Authors: Kaspar Fischer, B. Gärtner, Martin Kuetz 
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Recommendations
- scientific article; zbMATH DE number 1985309
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Approximate minimum enclosing balls in high dimensions using core-sets
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Efficient algorithms for the smallest enclosing ball problem
- A fast deterministic smallest enclosing disk approximation algorithm
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Algorithms - ESA 2003
Cited In (29)
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- Approximate minimum enclosing balls in high dimensions using core-sets
- Optimization algorithms for faster computational geometry
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- Minimal containment under homothetics: a simple cutting plane approach
- The nearest polynomial to multiple given polynomials with a given zero in the real case
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- Title not available (Why is that?)
- Packing of concave polyhedra with continuous rotations using nonlinear optimisation
- Finding the homology of submanifolds with high confidence from random samples
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- On approximating the Riemannian 1-center
- Efficient algorithms for the smallest enclosing ball problem
- Distance between the fractional Brownian motion and the space of adapted Gaussian martingales
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
- Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
- On the string consensus problem and the Manhattan sequence consensus problem
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Fast estimation of the shear stress amplitude for fatigue life analysis of metals
- Algorithms - ESA 2003
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- A hybrid algorithm for the minimum bounding sphere problem
- Reconstructing functions from random samples
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
- Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
Uses Software
This page was built for publication: Algorithms - ESA 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897282)
