Computing Euclidean bottleneck matchings in higher dimensions

DOI10.1016/S0020-0190(00)00096-XzbMath0997.05075MaRDI QIDQ1607062

Alon Efrat, Matthew J. Katz

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Faster bottleneck non-crossing matchings of points in convex position ⋮ Approximating the bottleneck plane perfect matching of a point set ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Bottleneck flows in unit capacity networks ⋮ Optimal point movement for covering circular regions

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

This page was built for publication: Computing Euclidean bottleneck matchings in higher dimensions