Preclustering algorithms for imprecise points
From MaRDI portal
Publication:2144264
DOI10.1007/S00453-022-00929-9OpenAlexW4210885240MaRDI QIDQ2144264FDOQ2144264
Morteza Saghafian, Mohammad A. Abam, Mark de Berg, Sina Farahzad, Mir-Omid Haji-Mirsadeghi
Publication date: 1 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00929-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximation algorithm for the generalized assignment problem
- A Best Possible Heuristic for the k-Center Problem
- The planar \(k\)-means problem is NP-hard
- Exact and approximation algorithms for clustering
- On the Complexity of Some Common Geometric Location Problems
- A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
- A PTAS for k-means clustering based on weak coresets
- Largest area convex hull of imprecise data based on axis-aligned squares
- Largest and smallest convex hulls for imprecise points
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended
- Are stable instances easy?
- Exponential lower bound for the translative kissing numbers of \(d\)-dimensional convex bodies
- Separability of imprecise points
- Minimizing the diameter of a spanning tree for imprecise points
Cited In (3)
Recommendations
- Title not available (Why is that?) π π
- Efficient approximation algorithms for clustering point-sets π π
- Exact and approximation algorithms for clustering π π
- Approximation schemes for clustering problems π π
- Preprocessing Imprecise Points and Splitting Triangulations π π
- Preprocessing Imprecise Points and Splitting Triangulations π π
- Approximation algorithms for clustering with dynamic points π π
- Fast indefinite multi-point (IMP) clustering π π
- Preprocessing Ambiguous Imprecise Points π π
- Preclustering Algorithms for Imprecise Points π π
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)