A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let n=|R∪ B|. A bichromatic spanning tree is a spanning tree in the complete bipartite geometric graph with bipartition (R,B). The minimum (respectively maximum) bichromatic spanning tree problem is the problem of computing a bichromatic spanning tree of minimum (respectively maximum) total edge length. 1. We present a simple algorithm that solves the minimumarXiv:1611.01661v1 fatcat:mklikketuza4zibcf4vwkjqgr4