[1]
Biniaz, A., Maheshwari, A. and Smid, M. 2022. Approximating bottleneck spanning trees on partitioned tuples of points. Computing in Geometry and Topology. 1, 1 (Oct. 2022), 3:1–3:18. DOI:https://doi.org/10.57717/cgt.v1i1.17.