Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
type: Item
instance of: scholarly article
title: Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
zbMATH Open document ID: 0748.68081
DOI: 10.1007/BF01758842
author: Chuan Yi Tang
author: Maw-Shang Chang
author: R. C. T. Lee
published in: Algorithmica
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 64256
zbMATH Keywords: bottleneck optimization problem
zbMATH Keywords: Euclidean bottleneck matching problem
zbMATH Keywords: relative neighborhood graphs
MaRDI profile type: Publication
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Algorithms for two bottleneck optimization problems
cites work: Computing relative neighbourhood graphs in the plane
cites work: Q3048571
cites work: The relative neighbourhood graph of a finite planar set
full work available at URL: https://doi.org/10.1007/bf01758842
OpenAlex ID: W2065158139
description: scientific article; zbMATH DE number 64256