Bottleneck Matching in the Plane

Discret. Comput. Geom. Pub Date : 2022-05-12 DOI:10.48550/arXiv.2205.05887

M. J. Katz, M. Sharir

引用次数: 2

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

平面中的瓶颈匹配

提出了一种计算瓶颈匹配的算法 $n=2\ell$ 平面上的点 $O(n^{\omega/2}\log n)$ 确定性时间 $\omega\approx 2.37$ 是矩阵乘法的指数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Discret. Comput. Geom.

自引率

0.00%

发文量

期刊最新文献

On Reverse Shortest Paths in Geometric Proximity Graphs Algorithms for Radius-Optimally Augmenting Trees in a Metric Space Augmenting Graphs to Minimize the Radius Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces Intersecting Disks Using Two Congruent Disks