New approximation algorithms for minimum enclosing convex shapes
From MaRDI portal
Recommendations
Cited in
(13)- A new algorithm for the minimal-area convex enclosure problem
- No dimension-independent core-sets for containment under homothetics
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Two Algorithms for the Minimum Enclosing Ball Problem
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Sparse approximation via generating point sets
- Optimization algorithms for faster computational geometry
- Linear coupling: an ultimate unification of gradient and mirror descent
- scientific article; zbMATH DE number 742951 (Why is no real title available?)
- Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
- Approximate minimum enclosing balls in high dimensions using core-sets
- scientific article; zbMATH DE number 7651177 (Why is no real title available?)
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
This page was built for publication: New approximation algorithms for minimum enclosing convex shapes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365105)