Bottleneck matching in the plane

Matthew J. Katz*, Micha Sharir

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We present a randomized algorithm that with high probability finds a bottleneck matching in a set of n=2ℓ points in the plane. The algorithm's running time is O(nω/2log⁡n), where ω>2 is a constant such that any two n×n matrices can be multiplied in time O(nω). The state of the art in fast matrix multiplication allows us to set ω=2.3728596.

Original languageEnglish
Article number101986
JournalComputational Geometry: Theory and Applications
StatePublished - Jun 2023


  • Bottleneck matching
  • Geometric optimization
  • Matrix multiplication
  • Order-k Voronoi diagram
  • Unit disk graph


Dive into the research topics of 'Bottleneck matching in the plane'. Together they form a unique fingerprint.

Cite this