Dynamic Euclidean bottleneck matching

DOI10.1016/J.TCS.2024.114727MaRDI QIDQ6612538zbMATH OpenFDO

Authors A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Publication date 1 October 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114727

zbMATH Keywords

bottleneck matchingdynamic matchingminimum-weight matching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• A near-linear constant-factor approximation for Euclidean bipartite matching?
• A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
• Algorithms for two bottleneck optimization problems
• An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
• Approximating the bottleneck plane perfect matching of a point set
• Approximation and Online Algorithms
• Bottleneck non-crossing matching in the plane
• Computing Euclidean bottleneck matchings in higher dimensions
• Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching
• Dynamic Geometric Set Cover and Hitting Set
• Fast Matching Algorithms for Points on a Polygon
• Faster dynamic matchings and vertex connectivity
• Geometry Helps in Matching
• Monochromatic plane matchings in bicolored point set
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
• Worst-case Analysis of Set Union Algorithms

This page was built for publication: Dynamic Euclidean bottleneck matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612538)