Preclustering algorithms for imprecise points
From MaRDI portal
Publication:2144264
Recommendations
- Preclustering Algorithms for Imprecise Points
- Efficient approximation algorithms for clustering point-sets
- Approximation schemes for clustering problems
- Fast indefinite multi-point (IMP) clustering
- Preprocessing Ambiguous Imprecise Points
- Preprocessing Imprecise Points and Splitting Triangulations
- Preprocessing Imprecise Points and Splitting Triangulations
- Approximation algorithms for clustering with dynamic points
- Approximation algorithms for clustering with dynamic points
- Exact and approximation algorithms for clustering
Cites work
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- scientific article; zbMATH DE number 1786519 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- A PTAS for k-means clustering based on weak coresets
- A simple \(D ^{2}\)-sampling based PTAS for \(k\)-means and other clustering problems
- An approximation algorithm for the generalized assignment problem
- Are stable instances easy?
- Exact and approximation algorithms for clustering
- Exponential lower bound for the translative kissing numbers of \(d\)-dimensional convex bodies
- Largest and smallest convex hulls for imprecise points
- Largest area convex hull of imprecise data based on axis-aligned squares
- Minimizing the diameter of a spanning tree for imprecise points
- On the Complexity of Some Common Geometric Location Problems
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Separability of imprecise points
- The planar \(k\)-means problem is NP-hard
Cited in
(3)
This page was built for publication: Preclustering algorithms for imprecise points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144264)
