Solving the Euclidean bottleneck matching problem by k-relative neighborhood graphs

DOI10.1007/BF01758842MaRDI QIDQ1194341zbMATH OpenOpenAlexFDO

Authors Chuan Yi Tang, Maw-Shang Chang, R. C. T. Lee

Publication date 27 September 1992

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01758842

zbMATH Keywords

bottleneck optimization problemrelative neighborhood graphsEuclidean bottleneck matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• Approximating the bottleneck plane perfect matching of a point set
• Computing Euclidean bottleneck matchings in higher dimensions
• Computing fair and bottleneck matchings in geometric graphs
• Bottleneck non-crossing matching in the plane

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Algorithms for two bottleneck optimization problems
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Computing relative neighbourhood graphs in the plane
• The relative neighbourhood graph of a finite planar set

Cited in

(17)

• Matchings in higher-order Gabriel graphs
• Geometry helps in bottleneck matching and related problems
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Computing fair and bottleneck matchings in geometric graphs
• Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
• Monochromatic plane matchings in bicolored point set
• Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
• scientific article; zbMATH DE number 7662164 (Why is no real title available?)
• Structural properties of bichromatic non-crossing matchings
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• Faster bottleneck non-crossing matchings of points in convex position
• Dynamic Euclidean bottleneck matching
• Approximating the bottleneck plane perfect matching of a point set
• Bottleneck matching in the plane
• Computing Euclidean bottleneck matchings in higher dimensions
• Fast algorithms for computing \(\beta\)-skeletons and their relatives.
• 10-Gabriel graphs are Hamiltonian

This page was built for publication: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194341)