Sum of Squared Edges for MST of a Point Set in a Unit Square

O. Aichholzer, S. Allen, G. Aloupis, L. Barba, P. Bose, S. Langerman, and J. Iacono

Abstract:

Given a set P of points in the unit square let w(P) be the minimum sum of the squares of the edge lengths in the minimum spanning tree of P. We show that w(P) < 3.411.

Reference: O. Aichholzer, S. Allen, G. Aloupis, L. Barba, P. Bose, S. Langerman, and J. Iacono. Sum of squared edges for mst of a point set in a unit square. In Proc. $22^{nd}$ Annual Fall Workshop on Computational Geometry, University of Maryland, Maryland, USA, 2012.