Fast Approximate MST-based Clustering of Euclidean Graphs Using t-Spanners

We present a new algorithm that runs in O(nlogn) to improve the time complexity of approximate MST-based clustering algorithms by approximating the complete Euclidean graph using t-spanners which reduces the number of edges of the graph and the required time to generate the MST.