Dynamic Euclidean bottleneck matching

• Published in: Theoretical computer science Vol. 1013; p. 114727
• Main Authors: Abu-Affash, A. Karim, Bhore, Sujoy, Carmi, Paz
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 24.10.2024
• Subjects: Bottleneck matching; Dynamic matching; Minimum-weight matching; Dynamic matching; Minimum-weight matching; Bottleneck matching

A fundamental question in computational geometry is for a set of input points in the Euclidean space, that is subject to discrete changes (insertion/deletion of points at each time step), whether it is possible to maintain an exact/approximate minimum weight perfect matching and/or bottleneck matchi...