Minimal containment under homothetics: a simple cutting plane approach
From MaRDI portal
Publication:535290
DOI10.1007/s10589-009-9248-3zbMath1220.90089OpenAlexW2080009358MaRDI QIDQ535290
Publication date: 11 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9248-3
Related Items (7)
Minkowski concentricity and complete simplices ⋮ New algorithms for \(k\)-center and extensions ⋮ SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES ⋮ Diversities and the generalized circumradius ⋮ No dimension-independent core-sets for containment under homothetics ⋮ Uniqueness of circumcenters in generalized Minkowski spaces ⋮ New Algorithms for k-Center and Extensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New algorithms for \(k\)-center and extensions
- Solving general continuous single facility location problems by cutting planes
- Geometric algorithms and combinatorial optimization.
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Efficient algorithms for the smallest enclosing ball problem
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- The 2-Center Problem with Obstacles
- Circumspheres and Inner Products.
- Approximate clustering via core-sets
- Optimal scaling of balls and polyhedra
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Approximate minimum enclosing balls in high dimensions using core-sets
- Algorithms - ESA 2003
- Computational Science and Its Applications – ICCSA 2004
This page was built for publication: Minimal containment under homothetics: a simple cutting plane approach
