Fetching the paper…
Reading the bibliography…
We present massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of $n$ input $d$-dimensional vectors under Hamming, $\ell_1, \ell_2$ and $\ell_\infty$ distances.
Minimum spanning trees and single linkage cluster analysis
J. C. Gower and G. Ross · 1969
Earlier work this paper cites.
Graph-theoretical methods for detecting and describing gestalt clusters
C. T. Zahn · 1971
Earlier work this paper cites.
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu · 1998
Earlier work this paper cites.
High-dimensional Computational Geometry
P. Indyk · 2000
Earlier work this paper cites.
Geometric approximation via coresets
P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan · 2005
Earlier work this paper cites.
Performance guarantees for hierarchical clustering
S. Dasgupta and P. M. Long · 2005
Earlier work this paper cites.
On distributing symmetric streaming computations
J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina · 2008
Earlier work this paper cites.
Introduction to information retrieval
C. D. Manning, P. Raghavan, and H. Schütze · 2008
Earlier work this paper cites.
A model of computation for mapreduce
H. J. Karloff, S. Suri, and S. Vassilvitskii · 2010
Earlier work this paper cites.
Sorting, searching, and simulation in the mapreduce framework
M. T. Goodrich, N. Sitchinava, and Q. Zhang · 2011
Earlier work this paper cites.
Scalable k-means++
B. Bahmani, B. Moseley, A. Vattani, R. Kumar, and S. Vassilvitskii · 2012
Cited alongside, same era.
Distributed k-means and k-median clustering on general communication topologies
M. Balcan, S. Ehrlich, and Y. Liang · 2013
Cited alongside, same era.
Communication steps for parallel query processing
P. Beame, P. Koutris, and D. Suciu · 2013
Cited alongside, same era.
Finding connected components in map-reduce in logarithmic rounds
V. Rastogi, A. Machanavajjhala, L. Chitnis, and A. D. Sarma · 2013
Cited alongside, same era.
Parallel algorithms for geometric graph problems
A. Andoni, A. Nikolov, K. Onak, and G. Yaroslavtsev · 2014
Cited alongside, same era.
Parallel algorithms for geometric graph problems
A. Andoni, A. Nikolov, K. Onak, and G. Yaroslavtsev · 2014
A scalable hierarchical clustering algorithm using spark
C. Jin, R. Liu, Z. Chen, W. Hendrix, A. Agrawal, and A. Choudhary · 2015
Later among the works it cites.
Parallel algorithms for constructing range and nearest-neighbor searching data structures
P. K. Agarwal, K. Fox, K. Munagala, and A. Nath · 2016
Later among the works it cites.
A cost function for similarity-based hierarchical clustering
S. Dasgupta · 2016
Later among the works it cites.
Spark GraphX in action
M. S. Malak and R. East · 2016
Later among the works it cites.
Massively parallel algorithms for computing TIN dems and contour trees for large terrains
A. Nath, K. Fox, K. Munagala, and P. K. Agarwal · 2016
Later among the works it cites.
Shuffles and circuits: (on lower bounds for modern parallel computation)
T. Roughgarden, S. Vassilvitskii, and J. R. Wang · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Distributed balanced clustering via mapping coresets
M. Bateni, A. Bhaskara, S. Lattanzi, and V. Mirrokni · 2014
Cited alongside, same era.
Composable core-sets for diversity and coverage maximization
P. Indyk, S. Mahabadi, M. Mahdian, and V. S. Mirrokni · 2014
Cited alongside, same era.
Connected components in mapreduce and beyond
R. Kiveris, S. Lattanzi, V. S. Mirrokni, V. Rastogi, and S. Vassilvitskii · 2014
Cited alongside, same era.
On the computational complexity of mapreduce
B. Fish, J. Kun, Á. D. Lelkes, L. Reyzin, and G. Turán · 2015
Cited alongside, same era.
Later among the works it cites.
Hierarchical clustering via spreading metrics
A. Roy and S. Pokutta · 2016
Later among the works it cites.
Approximate hierarchical clustering via sparsest cut and spreading metrics
M. Charikar and V. Chatziafratis · 2017
Closest in time.
On distributed hierarchical clustering
M. Derakhshan, S. Behnezhad, M. Bateni, V. Mirrokni, M. Hajiaghayi, S. Lattanzi, and R. Kiveris · 2017
Closest in time.