Dynamic Euclidean bottleneck matching
From MaRDI portal
Publication:6612538
DOI10.1016/j.tcs.2024.114727MaRDI QIDQ6612538
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi
Publication date: 1 October 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Bottleneck non-crossing matching in the plane
- Approximating the bottleneck plane perfect matching of a point set
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
- Computing Euclidean bottleneck matchings in higher dimensions
- Monochromatic plane matchings in bicolored point set
- Geometry Helps in Matching
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- Worst-case Analysis of Set Union Algorithms
- Algorithms for two bottleneck optimization problems
- Fast Matching Algorithms for Points on a Polygon
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A near-linear constant-factor approximation for euclidean bipartite matching?
- Approximation and Online Algorithms
- Dynamic Geometric Set Cover and Hitting Set
- Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching
- An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
This page was built for publication: Dynamic Euclidean bottleneck matching
