Approximating the Bottleneck Plane Perfect Matching of a Point Set

A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi +2

A bottleneck plane perfect matching of a set of $n$ points in ${\mathbb{R}}^2$ is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the len…