Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model

DOI10.3233/FI-2021-2097OpenAlexW3215036344MaRDI QIDQ5862343

Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades, Mohammad Ghodsi

Publication date: 9 March 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.13989

zbMATH Keywords

\(k\)-center uncertain data approximation algorithms

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items

Computing \(k\)-centers of uncertain points on a real line, Minimum color spanning circle of imprecise points, Computing the center of uncertain points on cactus graphs

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tighter estimates for \(\epsilon\)-nets for disks
• One-dimensional \(k\)-center on uncertain data
• Improved results on geometric hitting set problems
• Approximation algorithms for a \(k\)-line center
• Largest and smallest convex hulls for imprecise points
• Improved approximation algorithms for geometric set cover
• The upper envelope of Voronoi surfaces and its applications
• Structural tolerance and Delaunay triangulation
• Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
• Range-max queries on uncertain data
• Largest and smallest area triangles on imprecise points
• An approximation algorithm for \(k\)-center problem on a convex polygon
• On approximability of minimum color-spanning ball in high dimensions
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Near-linear algorithms for geometric hitting sets and set covers
• On the expected diameter, width, and complexity of a stochastic convex hull
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• On the Most Likely Convex Hull of Uncertain Points
• Handbook of Approximation Algorithms and Metaheuristics
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Computing the Rectilinear Center of Uncertain Points in the Plane
• Stochastic k-Center and j-Flat-Center Problems
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS