On clustering bodies: geometry and polyhedral approximation
DOI10.1007/S00454-009-9226-7zbMATH Open1211.52014OpenAlexW2010255669MaRDI QIDQ603849FDOQ603849
Authors: Andreas Brieden, Peter Gritzmann 
Publication date: 8 November 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9226-7
Recommendations
optimizationpolynomial approximationpermutahedronconvex maximizationcomputational convexitygeometric clustering
Convex programming (90C25) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Deterministic and randomized polynomial‐time approximation of radii
- Title not available (Why is that?)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland
- On optimal weighted balanced clusterings: gravity bodies and power diagrams
- Title not available (Why is that?)
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Computational complexity of norm-maximization
Cited In (6)
- Title not available (Why is that?)
- Efficient solutions for weight-balanced partitioning problems
- Geometric clustering for the consolidation of farmland and woodland
- An LP-based \(k\)-means algorithm for balancing weighted point sets
- Constrained clustering via diagrams: a unified theory and its application to electoral district design
- Stable Clusterings and the Cones of Outer Normals
This page was built for publication: On clustering bodies: geometry and polyhedral approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603849)
