We present an algorithm for computing a bottleneck matching in a set of $n=2\ell$ points in the plane, which runs in $O(n^{\omega/2}\log n)$ deterministic time, where $\omega\approx 2.37$ is the exponent of matrix multiplication.

翻译：我们提出一种算法,用于计算在飞机上一组 $=2\ ell$ 的瓶颈匹配点, 其运行时间为$O(n ⁇ omega/2 ⁇ log n) 确定时间, 其中 $\ omega\ approx 2. 37$ 是矩阵乘法的引号 。