Bottleneck matching in the plane

Matthew J. Katz; Micha Sharir

doi:10.1016/j.comgeo.2023.101986

Bottleneck matching in the plane

Matthew J. Katz, Micha Sharir

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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 language	English
Article number	101986
Journal	Computational Geometry: Theory and Applications
Volume	112
DOIs	https://doi.org/10.1016/j.comgeo.2023.101986
State	Published - 1 Jun 2023

Keywords

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

ASJC Scopus subject areas

Computer Science Applications
Geometry and Topology
Control and Optimization
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/j.comgeo.2023.101986

Cite this

@article{fedf1c9dfca84570bd4639ee7b0e137f,

title = "Bottleneck matching in the plane",

abstract = "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.",

keywords = "Bottleneck matching, Geometric optimization, Matrix multiplication, Order-k Voronoi diagram, Unit disk graph",

author = "Katz, {Matthew J.} and Micha Sharir",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",

year = "2023",

month = jun,

day = "1",

doi = "10.1016/j.comgeo.2023.101986",

language = "English",

volume = "112",

journal = "Computational Geometry: Theory and Applications",

issn = "0925-7721",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Bottleneck matching in the plane

AU - Katz, Matthew J.

AU - Sharir, Micha

PY - 2023/6/1

Y1 - 2023/6/1

N2 - 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.

AB - 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.

KW - Bottleneck matching

KW - Geometric optimization

KW - Matrix multiplication

KW - Order-k Voronoi diagram

KW - Unit disk graph

UR - http://www.scopus.com/inward/record.url?scp=85148330978&partnerID=8YFLogxK

U2 - 10.1016/j.comgeo.2023.101986

DO - 10.1016/j.comgeo.2023.101986

M3 - Article

AN - SCOPUS:85148330978

SN - 0925-7721

VL - 112

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

M1 - 101986

ER -

Bottleneck matching in the plane

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this