A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees.

Sunil Arya David M. Mount

Published in: SODA (2016)

Keyphrases

learning algorithm
similarity measure
k means
minimum spanning trees
computational complexity
search space
np hard
probabilistic model
nearest neighbor
distance function
minimum spanning tree