Preclustering algorithms for imprecise points

DOI10.1007/s00453-022-00929-9OpenAlexW4210885240MaRDI QIDQ2144264

Morteza Saghafian, Mohammad Ali Abam, Sina Farahzad, Mir-Omid Haji-Mirsadeghi, Mark T. de Berg

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

zbMATH Keywords

clusteringcomputational geometryimprecise points

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

Computing the center of uncertain points on cactus graphs

Cites Work

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

This page was built for publication: Preclustering algorithms for imprecise points