Database Paper Browser

Back to papers

Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially

Summary: Coreset-based 2-round MapReduce for k-center with/without outliers; 1-pass streaming for the outlier variant. Achieves epsilon-additive approximation to best sequential k-center; space-efficient for small doubling dimension, empirical scalability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12003
Venue
VLDB
Year
2019
Pagerank
6.4638932e-05
Overall Rank
4,083 | 71.60%
DOI
10.14778/3317315.3317319

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers