Efficient approximation algorithms for clustering point-sets

DOI10.1016/J.COMGEO.2007.12.002zbMATH Open1181.62098OpenAlexW1970303631MaRDI QIDQ733558FDOQ733558

Authors: Guang Xu, Jinhui Xu 

Publication date: 16 October 2009

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.12.002

Recommendations

• Approximation schemes for clustering problems
• Exact and approximation algorithms for clustering
• On approximate geometric \(k\)-clustering
• Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
• scientific article; zbMATH DE number 1303609

zbMATH Keywords

core-setsk-center clusteringk-median clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Pattern classification.
• Approximation algorithms for NP-hard problems.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Clustering to minimize the maximum intercluster distance
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reductions among high dimensional proximity problems
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• Title not available (Why is that?)
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Algorithms for coloring quadtrees
• Approximation algorithms for a \(k\)-line center

Cited In (11)

• A unified framework for clustering constrained data without locality property
• Preclustering Algorithms for Imprecise Points
• Point clustering via voting maximization
• Title not available (Why is that?)
• Improved separated red-blue center clustering
• $k$-median clustering under discrete Fréchet and Hausdorff distances
• Preclustering algorithms for imprecise points
• Exact and approximation algorithms for clustering
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
• Approximate range queries for clustering
• Active clustering of biological sequences

This page was built for publication: Efficient approximation algorithms for clustering point-sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733558)