Sublinear-time approximation algorithms for clustering via random sampling-Reference-Cited by-同舟云学术

Sublinear-time approximation algorithms for clustering via random sampling

Published:2006 Issue:1-2 Volume:30 Page:226-256
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Czumaj Artur,Sohler Christian

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference31 articles.

1. , , Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 106–113.

2. Local Search Heuristics for k-Median and Facility Location Problems

3. , , Approximate clustering via core-sets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 250–257.

4. , , Approximating min-sum k-clustering in metric spaces. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 11–20.

5. , Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 378–388.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic metric 1-median selection with very few queries;Theoretical Computer Science;2024-10

2. Settling Time vs. Accuracy Tradeoffs for Clustering Big Data;Proceedings of the ACM on Management of Data;2024-05-29

3. Coresets for kernel clustering;Machine Learning;2024-04-22

4. KF K-means: A High Performance K-means Implementation using Kernel Fusion;2023 IEEE International Conference on Big Data (BigData);2023-12-15

5. On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters;Theory of Computing Systems;2022-06-17