Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
scientific article; zbMATH DE number 64256