On clustering bodies: geometry and polyhedral approximation

DOI10.1007/S00454-009-9226-7MaRDI QIDQ603849zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimizationpolynomial approximationpermutahedronconvex maximizationcomputational convexitygeometric clustering

Mathematics Subject Classification ID

Convex programming (90C25) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 3921982
• Algorithms – ESA 2005
• scientific article
• Clustering to minimize the maximum intercluster distance
• Linear-time approximation schemes for clustering problems in any dimensions

Cites work

• scientific article; zbMATH DE number 480235 (Why is no real title available?)
• scientific article; zbMATH DE number 2159163 (Why is no real title available?)
• scientific article; zbMATH DE number 1404748 (Why is no real title available?)
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Computational complexity of norm-maximization
• Constrained minimum-k-star clustering and its application to the consolidation of farmland
• Convex Analysis
• Deterministic and randomized polynomial‐time approximation of radii
• On optimal weighted balanced clusterings: gravity bodies and power diagrams
• On the complexity of some basic problems in computational convexity. I. Containment problems

Cited in

(6)

• Stable Clusterings and the Cones of Outer Normals
• scientific article; zbMATH DE number 5287125 (Why is no real title available?)
• 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

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)