Computing Euclidean bottleneck matchings in higher dimensions
From MaRDI portal
Publication:1607062
DOI10.1016/S0020-0190(00)00096-XzbMath0997.05075MaRDI QIDQ1607062
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
- Balanced optimization problems
- Minimum deviation problems
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
- Relative neighborhood graphs in three dimensions
- Geometry Helps in Matching
- Algorithms for two bottleneck optimization problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs