On Minimum Spanning Trees for Random Euclidean Bipartite Graphs

Mario Correddu, Dario Trevisan

We consider the minimum spanning tree problem on a weighted complete bipartite graph $K_{n_R,n_B}$ whose $n=n_R+n_B$ vertices are random, i.i.d. uniformly distributed points in th…