.png){kind=icon}
.png){kind=icon}
Return
Minimum Plane Bichromatic Spanning Trees
.png){kind=icon}
PRE
AI
DOI：10.1145/3747591.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For a set of red and blue points in the plane, a Minimum Bichromatic Spanning Tree (MinBST) is a shortest spanning tree of the points such that every edge has a red and a blue endpoint. A MinBST can be computed in O(n log n) time where n is the number of points. In contrast to the standard Euclidean MST, which is always plane (noncrossing), a MinBST may have edges that cross each other. However, we prove that a MinBST is quasi-plane, that is, it does not contain three pairwise crossing edges, and we determine the maximum number of crossings. Moreover, we study the problem of finding a Minimum Plane Bichromatic Spanning Tree (MinPBST) which is a shortest bichromatic spanning tree with pairwise noncrossing edges. This problem is known to be NP-hard. The previous best approximation algorithm, due to Borgelt et al., has a ratio of O (root n). It is also known that the optimum solution can be computed in polynomial time in some special cases, for instance, when the points are in convex position, collinear, semi-collinear, or when one color class has constant size. We present an O (log n)-factor approximation algorithm for the general case.
Keywords:
Bichromatic Spanning Tree
Minimum Spanning Tree
Plane Tree
Journal
A
IF:
1.4
Papers:
43
Citations:
1.1K
Organization
View more organizations