Bottleneck Matching in the Plane
Abstract
We present an algorithm for computing a bottleneck matching in a set of n=2 points in the plane, which runs in O(nω/2 n) deterministic time, where ω≈ 2.37 is the exponent of matrix multiplication.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.