Minimal containment under homothetics: a simple cutting plane approach
From MaRDI portal
Publication:535290
DOI10.1007/S10589-009-9248-3zbMATH Open1220.90089OpenAlexW2080009358MaRDI QIDQ535290FDOQ535290
Authors: René Brandenberg, Lucia Roth 
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
Recommendations
- No dimension independent core-sets for containment under homothetics
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Multiple translational containment. I: An approximate algorithm
- No dimension-independent core-sets for containment under homothetics
- New Algorithms for k-Center and Extensions
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Efficient algorithms for the smallest enclosing ball problem
- Solving general continuous single facility location problems by cutting planes
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Algorithms - ESA 2003
- Approximate clustering via core-sets
- Title not available (Why is that?)
- Computational Science and Its Applications – ICCSA 2004
- Circumspheres and Inner Products.
- Title not available (Why is that?)
- Approximate minimum enclosing balls in high dimensions using core-sets
- Title not available (Why is that?)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- On the complexity of some basic problems in computational convexity. I. Containment problems
- The 2-center problem with obstacles
- Optimal scaling of balls and polyhedra
- New algorithms for \(k\)-center and extensions
Cited In (8)
- Sharpening geometric inequalities using computable symmetry measures
- New Algorithms for k-Center and Extensions
- New algorithms for \(k\)-center and extensions
- No dimension independent core-sets for containment under homothetics
- Uniqueness of circumcenters in generalized Minkowski spaces
- Diversities and the generalized circumradius
- Minkowski concentricity and complete simplices
- No dimension-independent core-sets for containment under homothetics
Uses Software
This page was built for publication: Minimal containment under homothetics: a simple cutting plane approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535290)
