Inner and outer j-radii of convex bodies in finite-dimensional normed spaces
Discrete & Computational Geometry
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Mathematical Programming: Series A and B
On the complexity of some basic problems in computational convexity: I.: containment problems
Discrete Mathematics - Special issue: trends in discrete mathematics
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Computational Geometry: Theory and Applications
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Minimal containment under homothetics: a simple cutting plane approach
Computational Optimization and Applications
New approximation algorithms for minimum enclosing convex shapes
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
This paper deals with the containment problem under homothetics, a generalization of the minimal enclosing ball (MEB) problem. We present some new geometric identities and inequalities in the line of Jung's Theorem and show how those effect the hope on fast approximation algorithms using small core-sets as they were developed in recent years for the MEB problem.