Clustering with faulty centers

DOI10.1016/j.comgeo.2023.102052MaRDI QIDQ6092308

No author found.

Publication date: 23 November 2023

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

clusteringapproximationuncertain inputprobabilistic input

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The \(p\)-neighbor \(k\)-center problem
• One-dimensional \(k\)-center on uncertain data
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• NP-hardness of Euclidean sum-of-squares clustering
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• Fault tolerant \(K\)-center problems
• Exact and approximation algorithms for clustering
• Probabilistic \(k\)-median clustering in data streams
• Net and Prune
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• A new greedy approach for facility location problems
• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• A Best Possible Heuristic for the k-Center Problem
• Stochastic k-Center and j-Flat-Center Problems
• Smallest enclosing ball for probabilistic data
• Closest Pair and the Post Office Problem for Stochastic Points
• Stochastic minimum spanning trees in euclidean spaces

This page was built for publication: Clustering with faulty centers