An Empirical Study of Locality-Sensitive Hashing to Approximate the Minimum Spanning Tree