Computing Euclidean bottleneck matchings in higher dimensions
type: Item
instance of: scholarly article
title: Computing Euclidean bottleneck matchings in higher dimensions
zbMATH Open document ID: 0997.05075
DOI: 10.1016/S0020-0190(00)00096-X
author: Alon Efrat
author: Matthew J. Katz
published in: Information Processing Letters
publication date: 2002-07-25T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1771770
MaRDI profile type: Publication
cites work: Relative neighborhood graphs in three dimensions
cites work: Farthest neighbors, maximum spanning trees and related problems in higher dimensions
cites work: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
cites work: Algorithms for two bottleneck optimization problems
cites work: Minimum deviation problems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q5519710
cites work: Q3048571
cites work: Balanced optimization problems
cites work: On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
cites work: Geometry Helps in Matching
description: scientific article; zbMATH DE number 1771770