Geometric clusterings

DOI10.1016/0196-6774(91)90007-LMaRDI QIDQ3361924zbMATH OpenOpenAlexFDO

Authors Vasilis Capoyleas, Günter Rote, Gerhard J. Woeginger

Publication date 1991

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90007-l

zbMATH Keywords

clusteringgeometric algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On approximate geometric \(k\)-clustering
• Three-clustering of points in the plane.
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 4074475
• Clustering to minimize the maximum intercluster distance

Cited in

(42)

• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
• Minimizing the sum of diameters efficiently
• Separable partitions
• An approximate algorithm for computing multidimensional convex hulls
• Polynomial algorithms for nested univariate clustering
• Cluster analysis and mathematical programming
• Mathematical methods of geoinformatics. I: A new approach to clusterization
• On approximate geometric \(k\)-clustering
• A randomized approximation scheme for metric MAX-CUT
• Geometric clustering in normed planes
• Covering points with convex sets of minimum size
• Some clustering algorithms in normed planes
• Optimal separable partitioning in the plane
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
• Minimum perimeter-sum partitions in the plane
• Counting disjoint 2-partitions for points in the plane
• A weakly robust PTAS for minimum clique partition in unit disk graphs
• Three-clustering of points in the plane.
• Kinetic clustering of points on the line
• scientific article; zbMATH DE number 5287125 (Why is no real title available?)
• scientific article; zbMATH DE number 4074475 (Why is no real title available?)
• scientific article; zbMATH DE number 45205 (Why is no real title available?)
• scientific article; zbMATH DE number 1507292 (Why is no real title available?)
• On separable clusterings
• scientific article; zbMATH DE number 804595 (Why is no real title available?)
• Static and Dynamic Algorithms for k-Point Clustering Problems
• On the number of separable partitions
• On minimum sum of radii and diameters clustering
• New local searches for solving the multi-source Weber problem
• Computing the coarseness with strips or boxes
• Algorithms – ESA 2005
• GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
• A local search approximation algorithm for \(k\)-means clustering
• Efficient \(k\)-center algorithms for planar points in convex position
• Approximating fair \(k\)-min-sum-radii in Euclidean space
• Minimum clique partition in unit disk graphs
• Computing the coarseness measure of a bicolored point set over guillotine partitions
• A faster algorithm for the two-center decision problem
• Geometric Knapsack problems
• Clustering with few disks to minimize the sum of radii
• Unmanned aerial vehicle variable radius set covering problem for emergency wireless network
• Subexponential algorithms for clique cover on unit disk and unit ball graphs

This page was built for publication: Geometric clusterings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3361924)