Algorithmica

, Volume 81, Issue 4, pp 1512–1534

# Maximum Plane Trees in Multipartite Geometric Graphs

• Prosenjit Bose
• Kimberly Crosbie
• Jean-Lou De Carufel
• David Eppstein
• Anil Maheshwari
• Michiel Smid
Article

## Abstract

A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a geometric graph is a spanning tree that is non-crossing. Let R and B be two disjoint sets of points in the plane such that $$R\cup B$$ is in general position, and let $$n=|R\cup B|$$. Assume that the points of R are colored red and the points of B are colored blue. A bichromatic plane spanning tree is a plane spanning tree in the complete bipartite geometric graph with bipartition (RB). In this paper we consider the maximum bichromatic plane spanning tree problem, which is the problem of computing a bichromatic plane spanning tree of maximum total edge length.
1. 1.

For the maximum bichromatic plane spanning tree problem, we present an approximation algorithm with ratio 1 / 4 that runs in $$O(n\log n)$$ time.

2. 2.

We also consider the multicolored version of this problem where the input points are colored with $$k>2$$ colors. We present an approximation algorithm that computes a plane spanning tree in a complete k-partite geometric graph, and whose ratio is 1 / 6 if $$k=3$$, and 1 / 8 if $$k\geqslant 4$$.

3. 3.

We also revisit the special case of the problem where $$k=n$$, i.e., the problem of computing a maximum plane spanning tree in a complete geometric graph. For this problem, we present an approximation algorithm with ratio 0.503; this is an extension of the algorithm presented by Dumitrescu and Tóth (Discrete Comput Geom 44(4):727–752, 2010) whose ratio is 0.502.

4. 4.

For points that are in convex position, the maximum bichromatic plane spanning tree problem can be solved in $$O(n^3)$$ time. We present an $$O(n^5)$$-time algorithm that solves this problem for the case where the red points lie on a line and the blue points lie on one side of the line.

## Keywords

Multipartite geometric graphs Plane spanning trees Maximum spanning trees Approximation algorithms

## Notes

### Acknowledgements

We would like to thank an anonymous referee whose comments improved the readability of the paper. Funding was provide by NSERC and NSF (Grant CCF-1228639)

## References

1. 1.
Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. Fund. Inf. 22(4), 385–394 (1995). (also in Proceedings of the 9th ACM Symposium on Computational Geometry (SoCG), pp. 257–263, 1993)
2. 2.
Biniaz, A., Bose, P., Eppstein, D., Maheshwari, A., Morin, P., Smid, M.: Spanning trees in multipartite geometric graphs. Algorithmica (2017).
3. 3.
Borgelt, M.G., van Kreveld, M.J., Löffler, M., Luo, J., Merrick, D., Silveira, R.I., Vahedi, M.: Planar bichromatic minimum spanning trees. J. Discrete Algorithms 7(4), 469–478 (2009)
4. 4.
Dumitrescu, A., Tóth, C.D.: Long non-crossing configurations in the plane. Discrete Comput. Geom. 44(4), 727–752 (2010). (also in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 311–322, 2010)
5. 5.
Monma, C.L., Paterson, M., Suri, S., Yao, F.F.: Computing Euclidean maximum spanning trees. Algorithmica 5(3), 407–419 (1990)

## Authors and Affiliations

• 1
Email author
• Prosenjit Bose
• 2
• Kimberly Crosbie
• 2
• Jean-Lou De Carufel
• 3
• David Eppstein
• 4
• Anil Maheshwari
• 2
• Michiel Smid
• 2
1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada
2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
3. 3.School of Electrical Engineering and Computer ScienceUniversity of OttawaOttawaCanada
4. 4.Computer Science DepartmentUniversity of CaliforniaIrvineUSA