Geometric clusterings
From MaRDI portal
Publication:3361924
DOI10.1016/0196-6774(91)90007-LzbMath0734.68092OpenAlexW2911910046MaRDI QIDQ3361924
Gerhard J. Woeginger, Günter Rote, Vasilis Capoyleas
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Geometric clustering in normed planes, Optimal separable partitioning in the plane, Counting disjoint 2-partitions for points in the plane, Cluster analysis and mathematical programming, A local search approximation algorithm for \(k\)-means clustering, Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint, A weakly robust PTAS for minimum clique partition in unit disk graphs, Efficient \(k\)-center algorithms for planar points in convex position, Covering points with convex sets of minimum size, Minimum clique partition in unit disk graphs, On the number of separable partitions, On minimum sum of radii and diameters clustering, New local searches for solving the multi-source Weber problem, A faster algorithm for the two-center decision problem, Minimizing the sum of diameters efficiently, Geometric Knapsack problems, Computing the coarseness with strips or boxes, Three-clustering of points in the plane., Some clustering algorithms in normed planes, Minimum perimeter-sum partitions in the plane, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, Separable partitions, An approximate algorithm for computing multidimensional convex hulls, A randomized approximation scheme for metric MAX-CUT
