Fetching the paper…
Reading the bibliography…
Clustering of data points in metric space is among the most fundamental problems in computer science with plenty of applications in data mining, information retrieval and machine learning.
Randomness-efficient oblivious sampling
Mihir Bellare and John Rompel · 1994
Earlier work this paper cites.
Clustering data streams
Sudipto Guha, Nina Mishra, R. Motwani, and L. O’Callaghan · 2000
Earlier work this paper cites.
Better streaming algorithms for clustering problems
Moses Charikar, Liadan O’Callaghan, and Rina Panigrahy · 2003
Earlier work this paper cites.
On coresets for k-means and k-median clustering
Sariel Har-Peled and Soham Mazumdar · 2004
Earlier work this paper cites.
Coresets in dynamic geometric data streams
Gereon Frahling and Christian Sohler · 2005
Earlier work this paper cites.
Smaller coresets for k-median and k-means clustering
Sariel Har-Peled and Akash Kushal · 2005
Earlier work this paper cites.
A ptas for k-means clustering based on weak coresets
Dan Feldman, Morteza Monemizadeh, and Christian Sohler · 2007
Earlier work this paper cites.
On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications
Ke Chen · 2009
Earlier work this paper cites.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Earlier work this paper cites.
Computing minmax regret 1-median on a tree network with positive/negative vertex weights
Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song · 2012
Earlier work this paper cites.
Distributed balanced clustering via mapping coresets
MohammadHossein Bateni, Aditya Bhaskara, Silvio Lattanzi, and Vahab Mirrokni · 2014
Cited alongside, same era.
A linear time algorithm for computing minmax regret 1-median on a tree network
Binay Bhattacharya, Tsunehiko Kameda, and Zhao Song · 2014
Cited alongside, same era.
Principal component analysis and higher correlations for distributed data
Ravindran Kannan, Santosh S Vempala, and David P Woodruff · 2014
Cited alongside, same era.
Robust hierarchical k-center clustering
Silvio Lattanzi, Stefano Leonardi, Vahab Mirrokni, and Ilya Razenshteyn · 2015
Cited alongside, same era.
New frameworks for offline and streaming coreset constructions
Vladimir Braverman, Dan Feldman, and Harry Lang · 2016
Cited alongside, same era.
Distributed low rank approximation of implicit functions of a matrix
David P Woodruff and Peilin Zhong · 2016
Later among the works it cites.
Lp-based algorithms for capacitated facility location
Hyung-Chan An, Mohit Singh, and Ola Svensson · 2017
Later among the works it cites.
Clustering high dimensional dynamic data streams
Vladimir Braverman, Gereon Frahling, Harry Lang, Christian Sohler, and Lin F Yang · 2017
Later among the works it cites.
On uniform capacitated k-median beyond the natural lp relaxation
Shi Li · 2017
Later among the works it cites.
Low rank approximation with entrywise ℓ 1 \ell_{1} -norm error
Zhao Song, David P Woodruff, and Peilin Zhong · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Arturs Backurs, Piotr Indyk, Eric Price, Ilya Razenshteyn, and David P Woodruff · 2016
Cited alongside, same era.
Clustering problems on sliding windows
Vladimir Braverman, Harry Lang, Keith Levin, and Morteza Monemizadeh · 2016
Cited alongside, same era.
An approximation algorithm for uniform capacitated k-median problem with 1 + ϵ 1+\epsilon capacity violation
Jarosław Byrka, Bartosz Rybicki, and Sumedha Uniyal · 2016
Cited alongside, same era.
Optimal principal component analysis in distributed and streaming models
Christos Boutsidis, David P Woodruff, and Peilin Zhong · 2016
Cited alongside, same era.
Constant approximation for capacitated k k -median with ( 1 + ϵ ) (1+\epsilon) -capacity violation
Gökalp Demirci and Shi Li · 2016
Cited alongside, same era.
Constant factor fpt approximation for capacitated k-median
Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed M Meesum, and Michał Włodarczyk · 2018
Later among the works it cites.
Nearly optimal dynamic k k -means clustering for high-dimensional data
Wei Hu, Zhao Song, Lin F Yang, and Peilin Zhong · 2018
Later among the works it cites.
Performance of johnson-lindenstrauss transform for k-means and k-medians clustering
Konstantin Makarychev, Yury Makarychev, and Ilya Razenshteyn · 2019
Closest in time.
Relative error tensor low rank approximation
Zhao Song, David P Woodruff, and Peilin Zhong · 2019
Closest in time.
A constant parameterized approximation for hard-capacitated k-means
Yicheng Xu, Rolf H.Mohring, Dachuan Xu, Yong Zhang, and Yifei Zou · 2019
Closest in time.