Preclustering algorithms for imprecise points (Q2144264): Difference between revisions

@@ Property / cites work @@
+Exact and approximation algorithms for clustering
@@ Property / cites work: Exact and approximation algorithms for clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542527
@@ Property / cites work: Q4542527 / rank @@
+Normal rank
@@ Property / cites work @@
+Are Stable Instances Easy?
@@ Property / cites work: Are Stable Instances Easy? / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing imprecise points for Delaunay triangulation: simplified and extended
+Normal rank
@@ Property / cites work @@
+A PTAS for k-means clustering based on weak coresets
+Normal rank
@@ Property / cites work @@
+A Best Possible Heuristic for the <i>k</i>-Center Problem
+Normal rank
@@ Property / cites work @@
+A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
+Normal rank
@@ Property / cites work @@
+Largest area convex hull of imprecise data based on axis-aligned squares
+Normal rank
@@ Property / cites work @@
+Minimizing the diameter of a spanning tree for imprecise points
+Normal rank
@@ Property / cites work @@
+Largest and smallest convex hulls for imprecise points
+Normal rank
@@ Property / cites work @@
+The planar \(k\)-means problem is NP-hard
@@ Property / cites work: The planar \(k\)-means problem is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Common Geometric Location Problems
+Normal rank
@@ Property / cites work @@
+Q4547814
@@ Property / cites work: Q4547814 / rank @@
+Normal rank
@@ Property / cites work @@
+Separability of imprecise points
@@ Property / cites work: Separability of imprecise points / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Exponential lower bound for the translative kissing numbers of \(d\)-dimensional convex bodies
+Normal rank