Preclustering algorithms for imprecise points

DOI10.1007/S00453-022-00929-9OpenAlexW4210885240MaRDI QIDQ2144264FDOQ2144264

Authors: Mohammad A. Abam, Sina Farahzad, Mir-Omid Haji-Mirsadeghi, Morteza Saghafian, Mark 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

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
• scientific article; zbMATH DE number 7651176
• Approximation algorithms for clustering with dynamic points
• Exact and approximation algorithms for clustering

zbMATH Keywords

clusteringcomputational geometryimprecise points

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)

• Computing the center of uncertain points on cactus graphs
• Preprocessing Imprecise Points and Splitting Triangulations
• Preprocessing Ambiguous 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)